TSTP Solution File: GRP092-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP092-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:49 EDT 2024
% Result : Unsatisfiable 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of clauses : 38 ( 32 unt; 0 nHn; 8 RR)
% Number of literals : 53 ( 52 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox/tmp/tmp.R3wJibY1Zk/E---3.1_19369.p',multiply) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.R3wJibY1Zk/E---3.1_19369.p',identity) ).
cnf(single_axiom,axiom,
divide(divide(X1,X2),divide(divide(X1,X3),X2)) = X3,
file('/export/starexec/sandbox/tmp/tmp.R3wJibY1Zk/E---3.1_19369.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.R3wJibY1Zk/E---3.1_19369.p',prove_these_axioms) ).
cnf(inverse,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
file('/export/starexec/sandbox/tmp/tmp.R3wJibY1Zk/E---3.1_19369.p',inverse) ).
cnf(c_0_5,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_6,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_7,plain,
divide(X1,divide(identity,X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
divide(divide(X1,X2),divide(divide(X1,X3),X2)) = X3,
single_axiom ).
cnf(c_0_9,plain,
divide(X1,identity) = multiply(X1,identity),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_10,plain,
multiply(divide(X1,divide(X1,X2)),identity) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_9]) ).
cnf(c_0_11,plain,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_12,plain,
multiply(divide(X1,X2),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_7]) ).
cnf(c_0_13,plain,
divide(X1,divide(X1,X2)) = X2,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,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_15,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
inverse ).
cnf(c_0_16,plain,
multiply(X1,divide(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,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_14 ).
cnf(c_0_18,plain,
inverse(X1) = divide(identity,X1),
inference(rw,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_19,plain,
multiply(divide(identity,X1),multiply(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_20,plain,
multiply(multiply(X1,X2),divide(identity,X2)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_21,plain,
multiply(identity,X1) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_22,plain,
divide(X1,multiply(identity,X2)) = multiply(X1,divide(identity,X2)),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_23,negated_conjecture,
( multiply(divide(identity,a1),a1) != multiply(divide(identity,b1),b1)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(divide(identity,b2),b2),a2) != a2
| multiply(a4,b4) != multiply(b4,a4) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]),c_0_18]) ).
cnf(c_0_24,plain,
multiply(divide(identity,X1),X1) = identity,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_25,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_7]),c_0_21]) ).
cnf(c_0_26,plain,
divide(multiply(X1,X2),multiply(divide(X1,X3),X2)) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_7]) ).
cnf(c_0_27,plain,
multiply(X1,divide(identity,X2)) = divide(X1,X2),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4)
| multiply(identity,a2) != a2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_24])]) ).
cnf(c_0_29,plain,
multiply(multiply(X1,X2),divide(identity,X1)) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_30,plain,
multiply(X1,multiply(divide(X2,X1),X3)) = multiply(X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_26]),c_0_25]) ).
cnf(c_0_31,plain,
divide(multiply(X1,X2),X2) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_21])]) ).
cnf(c_0_33,plain,
divide(multiply(X1,X2),X1) = X2,
inference(rw,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_34,plain,
multiply(multiply(X1,X2),X3) = multiply(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,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_32,c_0_25]),c_0_25])]) ).
cnf(c_0_36,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_33]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP092-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 16:17:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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.R3wJibY1Zk/E---3.1_19369.p
% 0.22/0.54 # Version: 3.1.0
% 0.22/0.54 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 19447 completed with status 0
% 0.22/0.54 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.22/0.54 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 811s (1) cores
% 0.22/0.54 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.22/0.54 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 0.22/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.54 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 19452 completed with status 0
% 0.22/0.54 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.22/0.54 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 811s (1) cores
% 0.22/0.54 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.22/0.54 # Preprocessing time : 0.001 s
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Unsatisfiable
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 5
% 0.22/0.54 # Removed by relevancy pruning/SinE : 0
% 0.22/0.54 # Initial clauses : 5
% 0.22/0.54 # Removed in clause preprocessing : 0
% 0.22/0.54 # Initial clauses in saturation : 5
% 0.22/0.54 # Processed clauses : 110
% 0.22/0.54 # ...of these trivial : 38
% 0.22/0.54 # ...subsumed : 20
% 0.22/0.54 # ...remaining for further processing : 52
% 0.22/0.54 # Other redundant clauses eliminated : 0
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 0
% 0.22/0.54 # Backward-rewritten : 27
% 0.22/0.54 # Generated clauses : 662
% 0.22/0.54 # ...of the previous two non-redundant : 301
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 0
% 0.22/0.54 # Paramodulations : 662
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 0
% 0.22/0.54 # Disequality decompositions : 0
% 0.22/0.54 # Total rewrite steps : 827
% 0.22/0.54 # ...of those cached : 652
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 25
% 0.22/0.54 # Positive orientable unit clauses : 23
% 0.22/0.54 # Positive unorientable unit clauses: 2
% 0.22/0.54 # Negative unit clauses : 0
% 0.22/0.54 # Non-unit-clauses : 0
% 0.22/0.54 # Current number of unprocessed clauses: 156
% 0.22/0.54 # ...number of literals in the above : 156
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 27
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.54 # Non-unit clause-clause subsumptions : 0
% 0.22/0.54 # Unit Clause-clause subsumption calls : 3
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 78
% 0.22/0.54 # BW rewrite match successes : 67
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 4516
% 0.22/0.54 # Search garbage collected termcells : 11
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.007 s
% 0.22/0.54 # System time : 0.002 s
% 0.22/0.54 # Total time : 0.008 s
% 0.22/0.54 # Maximum resident set size: 1568 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.032 s
% 0.22/0.54 # System time : 0.006 s
% 0.22/0.54 # Total time : 0.038 s
% 0.22/0.54 # Maximum resident set size: 1696 pages
% 0.22/0.54 % E---3.1 exiting
% 0.22/0.54 % E exiting
%------------------------------------------------------------------------------