TSTP Solution File: GRP477-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP477-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:49:09 EDT 2024
% Result : Unsatisfiable 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 6 RR)
% Number of literals : 36 ( 35 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(divide(divide(X1,X2),X3),divide(X4,X3))),divide(X2,X1)) = X4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(inverse(divide(divide(divide(X1,X2),X3),divide(X4,X3))),divide(X2,X1)) = X4,
single_axiom ).
cnf(c_0_4,plain,
divide(inverse(divide(divide(divide(X1,X2),divide(X3,X4)),X5)),divide(X2,X1)) = inverse(divide(divide(divide(X4,X3),X6),divide(X5,X6))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(divide(divide(divide(X1,X2),X3),divide(divide(X4,divide(X2,X1)),X3))) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
divide(inverse(divide(divide(X1,X2),divide(X3,X2))),divide(divide(X4,X5),inverse(divide(divide(divide(X5,X4),X6),divide(X1,X6))))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_7,plain,
divide(inverse(divide(divide(divide(divide(X1,X2),inverse(divide(divide(divide(X2,X1),X3),divide(X4,X3)))),X5),divide(X6,X5))),X4) = X6,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
inverse(divide(divide(X1,X2),divide(X3,X2))) = inverse(divide(divide(X1,X4),divide(X3,X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_3]) ).
cnf(c_0_9,plain,
divide(divide(inverse(divide(divide(divide(X1,X2),X3),X4)),divide(X2,X1)),X3) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_4]),c_0_3]) ).
cnf(c_0_10,plain,
divide(X1,divide(divide(X2,X3),inverse(divide(divide(divide(X3,X2),X4),divide(divide(X5,X6),X4))))) = divide(X1,divide(X6,X5)),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_11,plain,
inverse(divide(divide(X1,X2),divide(inverse(divide(divide(divide(X3,X4),X5),divide(X6,X5))),X2))) = inverse(divide(divide(X1,divide(X4,X3)),X6)),
inference(spm,[status(thm)],[c_0_8,c_0_3]) ).
cnf(c_0_12,plain,
divide(divide(X1,X2),inverse(divide(divide(divide(X2,X1),X3),divide(divide(X4,X5),X3)))) = divide(X5,X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_9]) ).
cnf(c_0_13,plain,
divide(inverse(divide(X1,divide(X2,X3))),divide(divide(X4,X5),inverse(divide(divide(divide(X5,X4),X3),X1)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_11]),c_0_3]) ).
cnf(c_0_14,plain,
inverse(divide(divide(divide(X1,divide(X2,X3)),X4),divide(divide(X5,X6),X4))) = divide(divide(inverse(divide(X6,X5)),divide(X3,X2)),X1),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,plain,
divide(divide(divide(inverse(divide(X1,X2)),divide(X3,X4)),X5),divide(divide(X4,X3),X5)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_16,plain,
inverse(divide(X1,divide(divide(X2,divide(divide(X3,X4),inverse(divide(divide(divide(X4,X3),X5),X1)))),X5))) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_17,plain,
divide(divide(divide(X1,X2),inverse(divide(X3,X4))),inverse(divide(X4,X3))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_18,plain,
divide(inverse(divide(X1,X2)),divide(divide(X3,X4),inverse(divide(X2,X1)))) = divide(X4,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_15]),c_0_12]) ).
cnf(c_0_19,plain,
inverse(divide(divide(divide(X1,X2),inverse(divide(X2,X1))),X3)) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_19]),c_0_3]) ).
cnf(c_0_21,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_23,plain,
divide(X1,divide(divide(X2,X3),divide(X2,X3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_21]),c_0_21]) ).
cnf(c_0_24,plain,
divide(X1,inverse(inverse(X2))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_22 ).
cnf(c_0_26,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_27,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X4),divide(X3,X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_8]),c_0_15]) ).
cnf(c_0_28,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
cnf(c_0_29,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_24]),c_0_9]) ).
cnf(c_0_30,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]),c_0_26]),c_0_26]) ).
cnf(c_0_31,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(X1,X3),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
divide(divide(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(rw,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_34,plain,
divide(divide(X1,inverse(X2)),X3) = divide(X1,divide(X3,X2)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP477-1 : TPTP v8.2.0. Released v2.6.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 05:17:07 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.51 # Version: 3.1.0
% 0.18/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.51 # Starting sh5l with 300s (1) cores
% 0.18/0.51 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 15370 completed with status 0
% 0.18/0.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.18/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.51 # No SInE strategy applied
% 0.18/0.51 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.18/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.18/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.18/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.18/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.51 # Starting sh5l with 136s (1) cores
% 0.18/0.51 # SAT001_MinMin_p005000_rr_RG with pid 15375 completed with status 0
% 0.18/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.51 # No SInE strategy applied
% 0.18/0.51 # Search class: FUUPF-FFSF21-MFFFFFNN
% 0.18/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.18/0.51 # Preprocessing time : 0.001 s
% 0.18/0.51 # Presaturation interreduction done
% 0.18/0.51
% 0.18/0.51 # Proof found!
% 0.18/0.51 # SZS status Unsatisfiable
% 0.18/0.51 # SZS output start CNFRefutation
% See solution above
% 0.18/0.51 # Parsed axioms : 3
% 0.18/0.51 # Removed by relevancy pruning/SinE : 0
% 0.18/0.51 # Initial clauses : 3
% 0.18/0.51 # Removed in clause preprocessing : 1
% 0.18/0.51 # Initial clauses in saturation : 2
% 0.18/0.51 # Processed clauses : 86
% 0.18/0.51 # ...of these trivial : 11
% 0.18/0.51 # ...subsumed : 31
% 0.18/0.51 # ...remaining for further processing : 44
% 0.18/0.51 # Other redundant clauses eliminated : 0
% 0.18/0.51 # Clauses deleted for lack of memory : 0
% 0.18/0.51 # Backward-subsumed : 1
% 0.18/0.51 # Backward-rewritten : 25
% 0.18/0.51 # Generated clauses : 3040
% 0.18/0.51 # ...of the previous two non-redundant : 2503
% 0.18/0.51 # ...aggressively subsumed : 0
% 0.18/0.51 # Contextual simplify-reflections : 0
% 0.18/0.51 # Paramodulations : 3040
% 0.18/0.51 # Factorizations : 0
% 0.18/0.51 # NegExts : 0
% 0.18/0.51 # Equation resolutions : 0
% 0.18/0.51 # Disequality decompositions : 0
% 0.18/0.51 # Total rewrite steps : 1919
% 0.18/0.51 # ...of those cached : 1050
% 0.18/0.51 # Propositional unsat checks : 0
% 0.18/0.51 # Propositional check models : 0
% 0.18/0.51 # Propositional check unsatisfiable : 0
% 0.18/0.51 # Propositional clauses : 0
% 0.18/0.51 # Propositional clauses after purity: 0
% 0.18/0.51 # Propositional unsat core size : 0
% 0.18/0.51 # Propositional preprocessing time : 0.000
% 0.18/0.51 # Propositional encoding time : 0.000
% 0.18/0.51 # Propositional solver time : 0.000
% 0.18/0.51 # Success case prop preproc time : 0.000
% 0.18/0.51 # Success case prop encoding time : 0.000
% 0.18/0.51 # Success case prop solver time : 0.000
% 0.18/0.51 # Current number of processed clauses : 16
% 0.18/0.51 # Positive orientable unit clauses : 15
% 0.18/0.51 # Positive unorientable unit clauses: 1
% 0.18/0.51 # Negative unit clauses : 0
% 0.18/0.51 # Non-unit-clauses : 0
% 0.18/0.51 # Current number of unprocessed clauses: 2383
% 0.18/0.51 # ...number of literals in the above : 2383
% 0.18/0.51 # Current number of archived formulas : 0
% 0.18/0.51 # Current number of archived clauses : 29
% 0.18/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.18/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.18/0.51 # Non-unit clause-clause subsumptions : 0
% 0.18/0.51 # Unit Clause-clause subsumption calls : 35
% 0.18/0.51 # Rewrite failures with RHS unbound : 0
% 0.18/0.51 # BW rewrite match attempts : 246
% 0.18/0.51 # BW rewrite match successes : 58
% 0.18/0.51 # Condensation attempts : 0
% 0.18/0.51 # Condensation successes : 0
% 0.18/0.51 # Termbank termtop insertions : 52655
% 0.18/0.51 # Search garbage collected termcells : 2
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.031 s
% 0.18/0.51 # System time : 0.004 s
% 0.18/0.51 # Total time : 0.035 s
% 0.18/0.51 # Maximum resident set size: 1572 pages
% 0.18/0.51
% 0.18/0.51 # -------------------------------------------------
% 0.18/0.51 # User time : 0.157 s
% 0.18/0.51 # System time : 0.012 s
% 0.18/0.51 # Total time : 0.169 s
% 0.18/0.51 # Maximum resident set size: 1684 pages
% 0.18/0.51 % E---3.1 exiting
% 0.18/0.51 % E exiting
%------------------------------------------------------------------------------