TSTP Solution File: GRP660-13 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP660-13 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:35 EDT 2024
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of clauses : 55 ( 55 unt; 0 nHn; 4 RR)
% Number of literals : 55 ( 54 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 107 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
cnf(f05,axiom,
mult(mult(mult(X1,X2),X3),X1) = mult(X1,mult(X2,mult(X3,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(goal,negated_conjecture,
mult(x0,ld(x1,x1)) != x0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c_0_6,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_7,axiom,
mult(mult(mult(X1,X2),X3),X1) = mult(X1,mult(X2,mult(X3,X1))),
f05 ).
cnf(c_0_8,plain,
rd(mult(X1,mult(X2,mult(X3,X1))),X1) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_10,plain,
rd(mult(X1,mult(X2,X3)),X1) = mult(mult(X1,X2),rd(X3,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_12,plain,
mult(mult(mult(X1,X2),X1),rd(X2,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,plain,
mult(mult(X1,rd(X2,X3)),rd(X3,X1)) = rd(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,plain,
ld(mult(mult(X1,X2),X1),mult(X1,X2)) = rd(X2,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_16,plain,
rd(rd(mult(X1,X2),X1),rd(X3,X1)) = mult(X1,rd(X2,X3)),
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_17,plain,
rd(mult(X1,X2),rd(X2,mult(X1,X2))) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_18,plain,
rd(ld(X1,X2),X2) = ld(mult(X2,X1),X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
rd(rd(mult(X1,X2),X1),X3) = mult(X1,rd(X2,mult(X3,X1))),
inference(spm,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_20,plain,
rd(X1,rd(X2,X1)) = mult(X1,rd(X1,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_21,plain,
mult(ld(mult(X1,X2),X1),X1) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_9,c_0_18]) ).
cnf(c_0_22,plain,
mult(X1,rd(ld(X1,X2),mult(X3,X1))) = rd(rd(X2,X1),X3),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,plain,
mult(X1,rd(X1,mult(X2,X1))) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_6]) ).
cnf(c_0_24,plain,
ld(mult(mult(X1,X2),X3),mult(X1,mult(X2,mult(X3,X1)))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_25,plain,
ld(ld(X1,X2),X1) = mult(ld(X2,X1),X1),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_26,plain,
rd(ld(X1,X2),mult(X3,X1)) = ld(X1,rd(rd(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_11,c_0_22]) ).
cnf(c_0_27,plain,
rd(X1,mult(X2,X1)) = ld(X1,rd(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_28,plain,
ld(mult(mult(ld(X1,X2),X3),X1),mult(ld(X1,X2),mult(X3,X2))) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_29,plain,
mult(ld(X1,X2),mult(ld(X2,X1),X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_30,plain,
ld(mult(mult(X1,X2),X2),mult(X1,X2)) = ld(X2,rd(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_26]),c_0_6]) ).
cnf(c_0_31,plain,
ld(ld(X1,X2),rd(ld(X1,X2),X1)) = ld(mult(X2,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_15]),c_0_18]) ).
cnf(c_0_32,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_33,plain,
ld(mult(mult(ld(X1,X1),ld(X1,X1)),X1),X1) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
ld(rd(X1,X1),rd(X1,X1)) = rd(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_13]),c_0_6]),c_0_11]) ).
cnf(c_0_35,plain,
ld(ld(X1,X1),ld(mult(X1,X1),X1)) = ld(mult(X1,X1),X1),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_36,plain,
mult(mult(ld(X1,X1),ld(X1,X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_32]) ).
cnf(c_0_37,plain,
mult(rd(X1,X1),rd(X1,X1)) = rd(X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_38,plain,
rd(ld(mult(X1,X1),X1),ld(mult(X1,X1),X1)) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_32,c_0_35]) ).
cnf(c_0_39,plain,
mult(ld(X1,X1),ld(X1,X1)) = rd(X1,X1),
inference(spm,[status(thm)],[c_0_6,c_0_36]) ).
cnf(c_0_40,plain,
rd(X1,X1) = ld(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_41,plain,
mult(X1,mult(ld(X1,X2),mult(X3,X1))) = mult(mult(X2,X3),X1),
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_42,plain,
ld(mult(mult(X1,rd(X2,mult(X3,X1))),X3),mult(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_9]) ).
cnf(c_0_43,plain,
mult(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
mult(mult(X1,rd(X2,X3)),X3) = mult(X3,mult(ld(X3,X1),X2)),
inference(spm,[status(thm)],[c_0_41,c_0_9]) ).
cnf(c_0_45,plain,
ld(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_34,c_0_38]) ).
cnf(c_0_46,plain,
ld(mult(ld(X1,X1),mult(ld(X1,X1),X2)),mult(ld(X1,X1),X2)) = ld(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]) ).
cnf(c_0_47,plain,
ld(mult(ld(X1,X1),X2),X2) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_46,c_0_15]) ).
cnf(c_0_48,plain,
rd(X1,ld(X2,X2)) = mult(ld(X2,X2),X1),
inference(spm,[status(thm)],[c_0_32,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
mult(x0,ld(x1,x1)) != x0,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_50,plain,
mult(X1,mult(X2,mult(ld(mult(X1,X2),X3),X1))) = mult(X3,X1),
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_51,plain,
mult(ld(X1,X1),mult(X2,ld(X1,X1))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
mult(x0,ld(x1,x1)) != x0,
c_0_49 ).
cnf(c_0_53,plain,
mult(X1,ld(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_39]),c_0_40]),c_0_15]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP660-13 : TPTP v8.2.0. Released v8.1.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 04:26:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 7827 completed with status 0
% 0.21/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.21/0.53 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.53 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.53 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.53 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.21/0.53 # U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 7834 completed with status 0
% 0.21/0.53 # Result found by U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.21/0.53 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.53 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 6
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 6
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 6
% 0.21/0.53 # Processed clauses : 140
% 0.21/0.53 # ...of these trivial : 47
% 0.21/0.53 # ...subsumed : 0
% 0.21/0.53 # ...remaining for further processing : 93
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 29
% 0.21/0.53 # Generated clauses : 2913
% 0.21/0.53 # ...of the previous two non-redundant : 2345
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 2913
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 1872
% 0.21/0.53 # ...of those cached : 1521
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 58
% 0.21/0.53 # Positive orientable unit clauses : 58
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 0
% 0.21/0.53 # Non-unit-clauses : 0
% 0.21/0.53 # Current number of unprocessed clauses: 2162
% 0.21/0.53 # ...number of literals in the above : 2162
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 35
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.53 # Non-unit clause-clause subsumptions : 0
% 0.21/0.53 # Unit Clause-clause subsumption calls : 0
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 110
% 0.21/0.53 # BW rewrite match successes : 22
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 37962
% 0.21/0.53 # Search garbage collected termcells : 2
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.038 s
% 0.21/0.53 # System time : 0.008 s
% 0.21/0.53 # Total time : 0.046 s
% 0.21/0.53 # Maximum resident set size: 1552 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.196 s
% 0.21/0.53 # System time : 0.035 s
% 0.21/0.53 # Total time : 0.231 s
% 0.21/0.53 # Maximum resident set size: 1680 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------