TSTP Solution File: GRP728-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP728-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:58:59 EDT 2024
% Result : Unsatisfiable 2.22s 0.77s
% Output : CNFRefutation 2.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 59 ( 59 unt; 0 nHn; 4 RR)
% Number of literals : 59 ( 58 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 139 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c06,axiom,
mult(i(X1),mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
cnf(c04,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c02,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c10,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
cnf(c05,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c11,axiom,
mult(X1,X2) = mult(mult(X2,X1),op_k(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
cnf(c22,axiom,
asoc(X1,X2,asoc(X3,X4,X5)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c22) ).
cnf(c12,axiom,
op_l(X1,X2,X3) = mult(i(mult(X3,X2)),mult(X3,mult(X2,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c12) ).
cnf(c03,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c01,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c09,axiom,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
cnf(c08,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
cnf(c07,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c21,axiom,
asoc(asoc(X1,X2,X3),X4,X5) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c21) ).
cnf(c14,axiom,
op_t(X1,X2) = mult(i(X2),mult(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c14) ).
cnf(goals,negated_conjecture,
op_k(op_k(a,b),c) != unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_16,axiom,
mult(i(X1),mult(X1,X2)) = X2,
c06 ).
cnf(c_0_17,axiom,
mult(i(X1),X1) = unit,
c04 ).
cnf(c_0_18,axiom,
mult(X1,unit) = X1,
c02 ).
cnf(c_0_19,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3)),
c10 ).
cnf(c_0_20,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
c05 ).
cnf(c_0_21,axiom,
mult(X1,X2) = mult(mult(X2,X1),op_k(X1,X2)),
c11 ).
cnf(c_0_22,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_23,axiom,
asoc(X1,X2,asoc(X3,X4,X5)) = unit,
c22 ).
cnf(c_0_24,axiom,
op_l(X1,X2,X3) = mult(i(mult(X3,X2)),mult(X3,mult(X2,X1))),
c12 ).
cnf(c_0_25,plain,
mult(mult(i(X1),mult(i(X2),i(X3))),mult(mult(X1,X2),X3)) = asoc(X1,X2,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_20]),c_0_20]) ).
cnf(c_0_26,plain,
mult(mult(i(X1),i(X2)),mult(X2,X1)) = op_k(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_20]) ).
cnf(c_0_27,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_28,axiom,
mult(X1,i(X1)) = unit,
c03 ).
cnf(c_0_29,axiom,
mult(unit,X1) = X1,
c01 ).
cnf(c_0_30,plain,
mult(mult(X1,mult(X2,mult(X3,X4))),asoc(X2,X3,X4)) = mult(X1,mult(mult(X2,X3),X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_19]),c_0_23]),c_0_18]) ).
cnf(c_0_31,plain,
mult(mult(i(X1),i(X2)),mult(X1,mult(X2,X3))) = op_l(X3,X2,X1),
inference(rw,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_32,plain,
mult(mult(i(X1),i(X2)),mult(mult(X1,X2),X3)) = X3,
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_33,plain,
asoc(i(X1),i(X2),mult(X2,X1)) = op_k(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_22]),c_0_22]),c_0_20]),c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_34,axiom,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
c09 ).
cnf(c_0_35,axiom,
mult(rd(X1,X2),X2) = X1,
c08 ).
cnf(c_0_36,axiom,
rd(mult(X1,X2),X2) = X1,
c07 ).
cnf(c_0_37,axiom,
asoc(asoc(X1,X2,X3),X4,X5) = unit,
c21 ).
cnf(c_0_38,plain,
mult(op_l(X1,X2,X3),asoc(X3,X2,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_39,plain,
asoc(X1,X2,op_k(X3,X4)) = unit,
inference(spm,[status(thm)],[c_0_23,c_0_33]) ).
cnf(c_0_40,plain,
mult(X1,mult(rd(X2,X1),mult(X1,X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
rd(X1,mult(X2,X1)) = i(X2),
inference(spm,[status(thm)],[c_0_36,c_0_16]) ).
cnf(c_0_42,plain,
mult(mult(i(X1),X2),X1) = op_l(X2,i(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_17]),c_0_18]),c_0_22]) ).
cnf(c_0_43,plain,
asoc(op_k(X1,X2),X3,X4) = unit,
inference(spm,[status(thm)],[c_0_37,c_0_33]) ).
cnf(c_0_44,plain,
mult(mult(i(X1),mult(i(X2),i(X3))),mult(X1,mult(X3,X2))) = op_l(op_k(X3,X2),mult(X2,X3),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_21]),c_0_20]) ).
cnf(c_0_45,plain,
op_l(op_k(X1,X2),X3,X4) = op_k(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_18]) ).
cnf(c_0_46,plain,
mult(mult(i(X1),X2),X1) = mult(i(X1),rd(X2,i(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_17]),c_0_18]) ).
cnf(c_0_47,plain,
rd(X1,op_l(X2,i(X2),X1)) = mult(X1,i(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_20]),c_0_22]) ).
cnf(c_0_48,plain,
op_l(X1,X2,op_k(X3,X4)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_43]),c_0_18]) ).
cnf(c_0_49,plain,
mult(mult(i(X1),mult(i(X2),i(X3))),mult(X1,mult(X3,X2))) = op_k(X3,X2),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,axiom,
op_t(X1,X2) = mult(i(X2),mult(X1,X2)),
c14 ).
cnf(c_0_51,plain,
mult(i(X1),rd(X2,i(X1))) = op_l(X2,i(X2),X1),
inference(rw,[status(thm)],[c_0_42,c_0_46]) ).
cnf(c_0_52,plain,
rd(op_k(X1,X2),X3) = mult(op_k(X1,X2),i(X3)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
op_k(op_k(a,b),c) != unit,
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_54,plain,
mult(i(X1),op_t(X1,X2)) = op_k(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_49]),c_0_16]),c_0_50]) ).
cnf(c_0_55,plain,
op_t(op_k(X1,X2),X3) = op_k(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_22]),c_0_50]),c_0_45]) ).
cnf(c_0_56,negated_conjecture,
op_k(op_k(a,b),c) != unit,
c_0_53 ).
cnf(c_0_57,plain,
op_k(op_k(X1,X2),X3) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_17]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP728-1 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.21/0.36 % CPULimit : 300
% 0.21/0.36 % WCLimit : 300
% 0.21/0.36 % DateTime : Sun May 19 05:38:08 EDT 2024
% 0.21/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.22/0.77 # Version: 3.1.0
% 2.22/0.77 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.22/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/0.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.22/0.77 # Starting new_bool_3 with 300s (1) cores
% 2.22/0.77 # Starting new_bool_1 with 300s (1) cores
% 2.22/0.77 # Starting sh5l with 300s (1) cores
% 2.22/0.77 # sh5l with pid 28262 completed with status 0
% 2.22/0.77 # Result found by sh5l
% 2.22/0.77 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.22/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/0.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.22/0.77 # Starting new_bool_3 with 300s (1) cores
% 2.22/0.77 # Starting new_bool_1 with 300s (1) cores
% 2.22/0.77 # Starting sh5l with 300s (1) cores
% 2.22/0.77 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.22/0.77 # Search class: FUUPM-FFMF32-MFFFFFNN
% 2.22/0.77 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.22/0.77 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 117s (1) cores
% 2.22/0.77 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 28266 completed with status 0
% 2.22/0.77 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 2.22/0.77 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.22/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.22/0.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.22/0.77 # Starting new_bool_3 with 300s (1) cores
% 2.22/0.77 # Starting new_bool_1 with 300s (1) cores
% 2.22/0.77 # Starting sh5l with 300s (1) cores
% 2.22/0.77 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.22/0.77 # Search class: FUUPM-FFMF32-MFFFFFNN
% 2.22/0.77 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.22/0.77 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 117s (1) cores
% 2.22/0.77 # Preprocessing time : 0.001 s
% 2.22/0.77
% 2.22/0.77 # Proof found!
% 2.22/0.77 # SZS status Unsatisfiable
% 2.22/0.77 # SZS output start CNFRefutation
% See solution above
% 2.22/0.77 # Parsed axioms : 23
% 2.22/0.77 # Removed by relevancy pruning/SinE : 0
% 2.22/0.77 # Initial clauses : 23
% 2.22/0.77 # Removed in clause preprocessing : 0
% 2.22/0.77 # Initial clauses in saturation : 23
% 2.22/0.77 # Processed clauses : 837
% 2.22/0.77 # ...of these trivial : 414
% 2.22/0.77 # ...subsumed : 56
% 2.22/0.77 # ...remaining for further processing : 367
% 2.22/0.77 # Other redundant clauses eliminated : 0
% 2.22/0.77 # Clauses deleted for lack of memory : 0
% 2.22/0.77 # Backward-subsumed : 0
% 2.22/0.77 # Backward-rewritten : 54
% 2.22/0.77 # Generated clauses : 26081
% 2.22/0.77 # ...of the previous two non-redundant : 17642
% 2.22/0.77 # ...aggressively subsumed : 0
% 2.22/0.77 # Contextual simplify-reflections : 0
% 2.22/0.77 # Paramodulations : 26081
% 2.22/0.77 # Factorizations : 0
% 2.22/0.77 # NegExts : 0
% 2.22/0.77 # Equation resolutions : 0
% 2.22/0.77 # Disequality decompositions : 0
% 2.22/0.77 # Total rewrite steps : 53427
% 2.22/0.77 # ...of those cached : 48464
% 2.22/0.77 # Propositional unsat checks : 0
% 2.22/0.77 # Propositional check models : 0
% 2.22/0.77 # Propositional check unsatisfiable : 0
% 2.22/0.77 # Propositional clauses : 0
% 2.22/0.77 # Propositional clauses after purity: 0
% 2.22/0.77 # Propositional unsat core size : 0
% 2.22/0.77 # Propositional preprocessing time : 0.000
% 2.22/0.77 # Propositional encoding time : 0.000
% 2.22/0.77 # Propositional solver time : 0.000
% 2.22/0.77 # Success case prop preproc time : 0.000
% 2.22/0.77 # Success case prop encoding time : 0.000
% 2.22/0.77 # Success case prop solver time : 0.000
% 2.22/0.77 # Current number of processed clauses : 313
% 2.22/0.77 # Positive orientable unit clauses : 300
% 2.22/0.77 # Positive unorientable unit clauses: 13
% 2.22/0.77 # Negative unit clauses : 0
% 2.22/0.77 # Non-unit-clauses : 0
% 2.22/0.77 # Current number of unprocessed clauses: 16699
% 2.22/0.77 # ...number of literals in the above : 16699
% 2.22/0.77 # Current number of archived formulas : 0
% 2.22/0.77 # Current number of archived clauses : 54
% 2.22/0.77 # Clause-clause subsumption calls (NU) : 0
% 2.22/0.77 # Rec. Clause-clause subsumption calls : 0
% 2.22/0.77 # Non-unit clause-clause subsumptions : 0
% 2.22/0.77 # Unit Clause-clause subsumption calls : 23
% 2.22/0.77 # Rewrite failures with RHS unbound : 0
% 2.22/0.77 # BW rewrite match attempts : 619
% 2.22/0.77 # BW rewrite match successes : 71
% 2.22/0.77 # Condensation attempts : 0
% 2.22/0.77 # Condensation successes : 0
% 2.22/0.77 # Termbank termtop insertions : 350204
% 2.22/0.77 # Search garbage collected termcells : 2
% 2.22/0.77
% 2.22/0.77 # -------------------------------------------------
% 2.22/0.77 # User time : 0.235 s
% 2.22/0.77 # System time : 0.017 s
% 2.22/0.77 # Total time : 0.252 s
% 2.22/0.77 # Maximum resident set size: 1640 pages
% 2.22/0.77
% 2.22/0.77 # -------------------------------------------------
% 2.22/0.77 # User time : 0.236 s
% 2.22/0.77 # System time : 0.019 s
% 2.22/0.77 # Total time : 0.255 s
% 2.22/0.77 # Maximum resident set size: 1696 pages
% 2.22/0.77 % E---3.1 exiting
%------------------------------------------------------------------------------