TSTP Solution File: GRP687-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP687-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:50:10 EDT 2023
% Result : Unsatisfiable 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 3 RR)
% Number of literals : 39 ( 38 equ; 2 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 81 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/tmp/tmp.Mdsshq0Dfn/E---3.1_17772.p',c05) ).
cnf(c07,axiom,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,mult(X1,X2)),X3),
file('/export/starexec/sandbox/tmp/tmp.Mdsshq0Dfn/E---3.1_17772.p',c07) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.Mdsshq0Dfn/E---3.1_17772.p',c04) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.Mdsshq0Dfn/E---3.1_17772.p',c01) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.Mdsshq0Dfn/E---3.1_17772.p',c02) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.Mdsshq0Dfn/E---3.1_17772.p',c03) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
file('/export/starexec/sandbox/tmp/tmp.Mdsshq0Dfn/E---3.1_17772.p',goals) ).
cnf(c_0_7,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_8,axiom,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,mult(X1,X2)),X3),
c07 ).
cnf(c_0_9,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).
cnf(c_0_10,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_11,plain,
mult(mult(X1,mult(X1,X2)),X3) = mult(X1,mult(X1,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
rd(mult(X1,mult(X1,mult(X2,X3))),X3) = mult(X1,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_14,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_15,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_16,plain,
rd(mult(X1,mult(X1,X2)),ld(X3,X2)) = mult(X1,mult(X1,X3)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
rd(mult(X1,X1),ld(X2,unit)) = mult(X1,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_19,plain,
ld(mult(X1,mult(X1,X2)),mult(X1,X1)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
mult(X1,mult(X1,mult(ld(X1,X2),X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_21,plain,
ld(mult(X1,X2),mult(X1,X1)) = ld(ld(X1,X2),unit),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_22,plain,
mult(X1,mult(ld(X1,X2),X3)) = ld(X1,mult(mult(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_23,plain,
ld(ld(X1,unit),unit) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_7]),c_0_14]) ).
cnf(c_0_24,plain,
mult(ld(X1,unit),mult(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_7]),c_0_14]) ).
cnf(c_0_25,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_26,plain,
rd(X1,mult(X2,X1)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
cnf(c_0_27,plain,
mult(X1,mult(X1,rd(X2,X3))) = rd(mult(X1,mult(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_28,plain,
rd(unit,X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_29,plain,
mult(ld(X1,unit),X2) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_30,plain,
ld(rd(X1,X2),unit) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_31,plain,
mult(X1,mult(X1,ld(X2,unit))) = rd(mult(X1,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_7]) ).
cnf(c_0_32,plain,
mult(rd(X1,X2),X3) = ld(rd(X2,X1),X3),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
mult(X1,mult(X1,ld(X2,X3))) = ld(rd(X2,mult(X1,X1)),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_31]),c_0_32]),c_0_29]) ).
cnf(c_0_34,plain,
ld(rd(X1,mult(X2,X2)),mult(X1,X3)) = mult(X2,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_33,c_0_14]) ).
cnf(c_0_35,plain,
ld(X1,mult(mult(X1,mult(X2,X2)),X3)) = mult(X2,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_34,c_0_10]) ).
cnf(c_0_36,negated_conjecture,
mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
goals ).
cnf(c_0_37,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(spm,[status(thm)],[c_0_13,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP687-1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n025.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 : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 02:36:36 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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/tmp/tmp.Mdsshq0Dfn/E---3.1_17772.p
% 0.15/0.45 # Version: 3.1pre001
% 0.15/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # sh5l with pid 17869 completed with status 0
% 0.15/0.45 # Result found by sh5l
% 0.15/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.45 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.15/0.45 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 17876 completed with status 0
% 0.15/0.45 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.15/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.45 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.15/0.45 # Preprocessing time : 0.001 s
% 0.15/0.45 # Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 # Proof found!
% 0.15/0.45 # SZS status Unsatisfiable
% 0.15/0.45 # SZS output start CNFRefutation
% See solution above
% 0.15/0.45 # Parsed axioms : 8
% 0.15/0.45 # Removed by relevancy pruning/SinE : 0
% 0.15/0.45 # Initial clauses : 8
% 0.15/0.45 # Removed in clause preprocessing : 0
% 0.15/0.45 # Initial clauses in saturation : 8
% 0.15/0.45 # Processed clauses : 112
% 0.15/0.45 # ...of these trivial : 28
% 0.15/0.45 # ...subsumed : 0
% 0.15/0.45 # ...remaining for further processing : 84
% 0.15/0.45 # Other redundant clauses eliminated : 0
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 0
% 0.15/0.45 # Backward-rewritten : 28
% 0.15/0.45 # Generated clauses : 2007
% 0.15/0.45 # ...of the previous two non-redundant : 1357
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 0
% 0.15/0.45 # Paramodulations : 2007
% 0.15/0.45 # Factorizations : 0
% 0.15/0.45 # NegExts : 0
% 0.15/0.45 # Equation resolutions : 0
% 0.15/0.45 # Total rewrite steps : 3858
% 0.15/0.45 # Propositional unsat checks : 0
% 0.15/0.45 # Propositional check models : 0
% 0.15/0.45 # Propositional check unsatisfiable : 0
% 0.15/0.45 # Propositional clauses : 0
% 0.15/0.45 # Propositional clauses after purity: 0
% 0.15/0.45 # Propositional unsat core size : 0
% 0.15/0.45 # Propositional preprocessing time : 0.000
% 0.15/0.45 # Propositional encoding time : 0.000
% 0.15/0.45 # Propositional solver time : 0.000
% 0.15/0.45 # Success case prop preproc time : 0.000
% 0.15/0.45 # Success case prop encoding time : 0.000
% 0.15/0.45 # Success case prop solver time : 0.000
% 0.15/0.45 # Current number of processed clauses : 48
% 0.15/0.45 # Positive orientable unit clauses : 48
% 0.15/0.45 # Positive unorientable unit clauses: 0
% 0.15/0.45 # Negative unit clauses : 0
% 0.15/0.45 # Non-unit-clauses : 0
% 0.15/0.45 # Current number of unprocessed clauses: 1195
% 0.15/0.45 # ...number of literals in the above : 1195
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 36
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.45 # Non-unit clause-clause subsumptions : 0
% 0.15/0.45 # Unit Clause-clause subsumption calls : 0
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 75
% 0.15/0.45 # BW rewrite match successes : 28
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 28857
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.020 s
% 0.15/0.45 # System time : 0.005 s
% 0.15/0.45 # Total time : 0.025 s
% 0.15/0.45 # Maximum resident set size: 1424 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.021 s
% 0.15/0.45 # System time : 0.006 s
% 0.15/0.45 # Total time : 0.027 s
% 0.15/0.45 # Maximum resident set size: 1672 pages
% 0.15/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------