TSTP Solution File: GRP088-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP088-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Sat May 4 07:48:48 EDT 2024
% Result : Unsatisfiable 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 4
% Syntax : Number of clauses : 57 ( 49 unt; 0 nHn; 10 RR)
% Number of literals : 77 ( 76 equ; 29 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox/tmp/tmp.mvCPOVlJlc/E---3.1_20366.p',multiply) ).
cnf(inverse,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
file('/export/starexec/sandbox/tmp/tmp.mvCPOVlJlc/E---3.1_20366.p',inverse) ).
cnf(single_axiom,axiom,
divide(X1,divide(X2,divide(X3,divide(X1,X2)))) = X3,
file('/export/starexec/sandbox/tmp/tmp.mvCPOVlJlc/E---3.1_20366.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox/tmp/tmp.mvCPOVlJlc/E---3.1_20366.p',prove_these_axioms) ).
cnf(c_0_4,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_5,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
inverse ).
cnf(c_0_6,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,axiom,
divide(X1,divide(X2,divide(X3,divide(X1,X2)))) = X3,
single_axiom ).
cnf(c_0_8,plain,
divide(multiply(inverse(X1),X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
inverse(divide(X1,multiply(X2,X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_5]),c_0_6]) ).
cnf(c_0_10,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,plain,
divide(inverse(divide(X1,X1)),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_12,plain,
multiply(multiply(inverse(X1),X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_13,plain,
multiply(divide(a1,a1),multiply(X1,divide(X2,X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_5]),c_0_10]) ).
cnf(c_0_14,plain,
multiply(inverse(divide(X1,X1)),X2) = multiply(divide(a1,a1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_10]) ).
cnf(c_0_15,plain,
inverse(multiply(X1,inverse(X1))) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_6]) ).
cnf(c_0_16,plain,
inverse(divide(X1,X1)) = divide(a1,a1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_13]) ).
cnf(c_0_17,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_18,plain,
inverse(multiply(inverse(X1),X1)) = divide(a1,a1),
inference(spm,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_19,plain,
multiply(inverse(X1),X1) = divide(a1,a1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_12]),c_0_15]),c_0_18]) ).
cnf(c_0_20,plain,
divide(a1,a1) = divide(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_6]),c_0_15]),c_0_19]) ).
cnf(c_0_21,plain,
divide(X1,divide(divide(X2,divide(X3,X1)),X2)) = X3,
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_22,plain,
divide(X1,X1) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_23,plain,
inverse(divide(X1,divide(a1,a1))) = inverse(X1),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_24,plain,
multiply(X1,divide(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_5]),c_0_6]) ).
cnf(c_0_25,plain,
inverse(divide(X1,divide(X2,X2))) = inverse(X1),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_26,plain,
multiply(divide(a1,a1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_24]),c_0_25]),c_0_10]) ).
cnf(c_0_27,plain,
multiply(divide(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_28,plain,
divide(X1,divide(divide(X2,divide(X3,divide(X1,X2))),divide(X4,X3))) = X4,
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_29,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_31,plain,
divide(X1,divide(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_5]),c_0_6]),c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
c_0_30 ).
cnf(c_0_33,plain,
multiply(divide(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(a4,b4) != multiply(b4,a4)
| inverse(inverse(a2)) != a2 ),
inference(rw,[status(thm)],[c_0_32,c_0_12]) ).
cnf(c_0_35,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_9,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(a4,b4) != multiply(b4,a4)
| multiply(divide(a1,a1),a2) != a2 ),
inference(rw,[status(thm)],[c_0_34,c_0_10]) ).
cnf(c_0_37,plain,
divide(multiply(X1,X2),X2) = X1,
inference(rw,[status(thm)],[c_0_9,c_0_35]) ).
cnf(c_0_38,plain,
multiply(inverse(X1),multiply(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_24,c_0_6]) ).
cnf(c_0_39,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4)
| multiply(divide(a1,a1),a2) != a2 ),
inference(sr,[status(thm)],[c_0_36,c_0_17]) ).
cnf(c_0_40,plain,
multiply(multiply(X1,inverse(X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_37]) ).
cnf(c_0_41,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_38,c_0_38]) ).
cnf(c_0_42,plain,
divide(X1,divide(inverse(X2),divide(X3,multiply(X1,X2)))) = X3,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_43,plain,
divide(inverse(X1),X2) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_6]) ).
cnf(c_0_44,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_24,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4)
| multiply(divide(X1,X1),a2) != a2 ),
inference(spm,[status(thm)],[c_0_39,c_0_20]) ).
cnf(c_0_46,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_38,c_0_41]) ).
cnf(c_0_48,plain,
multiply(X1,multiply(X2,divide(X3,multiply(X1,X2)))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_6]) ).
cnf(c_0_49,plain,
divide(multiply(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_31,c_0_37]) ).
cnf(c_0_50,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
inference(spm,[status(thm)],[c_0_45,c_0_26]) ).
cnf(c_0_51,plain,
multiply(inverse(X1),X2) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_52,plain,
inverse(inverse(multiply(X1,X2))) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_10]),c_0_26]) ).
cnf(c_0_53,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_44]),c_0_44])]) ).
cnf(c_0_55,plain,
multiply(X1,multiply(X2,X3)) = multiply(X3,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_6]),c_0_53]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(ar,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_44,c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GRP088-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n002.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 16:14:52 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.42 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/tmp/tmp.mvCPOVlJlc/E---3.1_20366.p
% 0.16/0.43 # Version: 3.1.0
% 0.16/0.43 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # new_bool_3 with pid 20446 completed with status 0
% 0.16/0.43 # Result found by new_bool_3
% 0.16/0.43 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FUHPS-FFSF21-MFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # SAT001_MinMin_p005000_rr_RG with pid 20450 completed with status 0
% 0.16/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.43 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FUHPS-FFSF21-MFFFFFNN
% 0.16/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Unsatisfiable
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 4
% 0.16/0.43 # Removed by relevancy pruning/SinE : 0
% 0.16/0.43 # Initial clauses : 4
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 4
% 0.16/0.43 # Processed clauses : 156
% 0.16/0.43 # ...of these trivial : 30
% 0.16/0.43 # ...subsumed : 54
% 0.16/0.43 # ...remaining for further processing : 72
% 0.16/0.43 # Other redundant clauses eliminated : 0
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 3
% 0.16/0.43 # Backward-rewritten : 42
% 0.16/0.43 # Generated clauses : 1012
% 0.16/0.43 # ...of the previous two non-redundant : 648
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 1011
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Disequality decompositions : 0
% 0.16/0.43 # Total rewrite steps : 1064
% 0.16/0.43 # ...of those cached : 749
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 22
% 0.16/0.43 # Positive orientable unit clauses : 19
% 0.16/0.43 # Positive unorientable unit clauses: 3
% 0.16/0.43 # Negative unit clauses : 0
% 0.16/0.43 # Non-unit-clauses : 0
% 0.16/0.43 # Current number of unprocessed clauses: 356
% 0.16/0.43 # ...number of literals in the above : 356
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 50
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 9
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 9
% 0.16/0.43 # Non-unit clause-clause subsumptions : 9
% 0.16/0.43 # Unit Clause-clause subsumption calls : 19
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 140
% 0.16/0.43 # BW rewrite match successes : 95
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 7242
% 0.16/0.43 # Search garbage collected termcells : 11
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.012 s
% 0.16/0.43 # System time : 0.000 s
% 0.16/0.43 # Total time : 0.012 s
% 0.16/0.43 # Maximum resident set size: 1676 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.015 s
% 0.16/0.43 # System time : 0.000 s
% 0.16/0.43 # Total time : 0.015 s
% 0.16/0.43 # Maximum resident set size: 1696 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E exiting
%------------------------------------------------------------------------------