TSTP Solution File: GRP658-10 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP658-10 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:49:57 EDT 2023
% Result : Unsatisfiable 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 3 RR)
% Number of literals : 33 ( 32 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 : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 79 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.MAdiT7p0FD/E---3.1_18258.p',f04) ).
cnf(f05,axiom,
mult(mult(X1,mult(X2,X2)),X3) = mult(mult(X1,X2),mult(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.MAdiT7p0FD/E---3.1_18258.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.MAdiT7p0FD/E---3.1_18258.p',f03) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.MAdiT7p0FD/E---3.1_18258.p',f02) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.MAdiT7p0FD/E---3.1_18258.p',f01) ).
cnf(goal,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
file('/export/starexec/sandbox/tmp/tmp.MAdiT7p0FD/E---3.1_18258.p',goal) ).
cnf(c_0_6,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_7,axiom,
mult(mult(X1,mult(X2,X2)),X3) = mult(mult(X1,X2),mult(X2,X3)),
f05 ).
cnf(c_0_8,plain,
rd(mult(mult(X1,X2),mult(X2,X3)),X3) = mult(X1,mult(X2,X2)),
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)),X3) = mult(rd(X1,X2),mult(X2,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
mult(rd(mult(X1,mult(X2,X3)),X3),X4) = mult(X1,mult(X2,X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_10]),c_0_9]) ).
cnf(c_0_12,plain,
mult(rd(mult(X1,X2),X3),X4) = mult(X1,mult(rd(X2,X3),X4)),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_13,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_14,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_15,plain,
mult(X1,mult(rd(X2,X2),X3)) = mult(X1,X3),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_16,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_17,plain,
rd(mult(mult(X1,X2),X3),ld(X2,X3)) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_18,plain,
mult(rd(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_15]),c_0_13]) ).
cnf(c_0_19,plain,
ld(mult(X1,mult(X2,X2)),mult(mult(X1,X2),X3)) = ld(X2,X3),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
mult(mult(rd(X1,mult(X2,X2)),X2),mult(X2,X3)) = mult(X1,X3),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_21,plain,
mult(X1,mult(rd(X2,mult(X1,X2)),X3)) = X3,
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_22,plain,
ld(X1,ld(mult(X2,X1),X3)) = ld(mult(X2,mult(X1,X1)),X3),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_23,plain,
mult(mult(rd(X1,mult(X2,X2)),X2),X3) = mult(X1,ld(X2,X3)),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_24,plain,
mult(rd(X1,mult(X2,X1)),X3) = ld(X2,X3),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_25,plain,
mult(X1,ld(mult(X2,mult(X1,X1)),X3)) = ld(mult(X2,X1),X3),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_26,plain,
rd(mult(X1,mult(X1,X2)),X2) = mult(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_18]),c_0_18]) ).
cnf(c_0_27,plain,
mult(ld(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14]) ).
cnf(c_0_28,plain,
mult(X1,ld(mult(X1,X1),X2)) = ld(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_18]),c_0_18]) ).
cnf(c_0_29,plain,
rd(X1,X1) = ld(X2,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_27]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
goal ).
cnf(c_0_31,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_13]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : GRP658-10 : TPTP v8.1.2. Released v8.1.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:34:24 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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.MAdiT7p0FD/E---3.1_18258.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 18335 completed with status 0
% 0.17/0.45 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.45 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.17/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.45 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.17/0.45 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.17/0.45 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.17/0.45 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 18343 completed with status 0
% 0.17/0.45 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.17/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.45 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.17/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.45 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Unsatisfiable
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 6
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 6
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 6
% 0.17/0.45 # Processed clauses : 66
% 0.17/0.45 # ...of these trivial : 24
% 0.17/0.45 # ...subsumed : 7
% 0.17/0.45 # ...remaining for further processing : 35
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 4
% 0.17/0.45 # Generated clauses : 653
% 0.17/0.45 # ...of the previous two non-redundant : 479
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 653
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Total rewrite steps : 570
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 31
% 0.17/0.45 # Positive orientable unit clauses : 27
% 0.17/0.45 # Positive unorientable unit clauses: 3
% 0.17/0.45 # Negative unit clauses : 1
% 0.17/0.45 # Non-unit-clauses : 0
% 0.17/0.45 # Current number of unprocessed clauses: 417
% 0.17/0.45 # ...number of literals in the above : 417
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 4
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.45 # Non-unit clause-clause subsumptions : 0
% 0.17/0.45 # Unit Clause-clause subsumption calls : 10
% 0.17/0.45 # Rewrite failures with RHS unbound : 20
% 0.17/0.45 # BW rewrite match attempts : 71
% 0.17/0.45 # BW rewrite match successes : 11
% 0.17/0.45 # Condensation attempts : 66
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 6452
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.009 s
% 0.17/0.45 # System time : 0.000 s
% 0.17/0.45 # Total time : 0.009 s
% 0.17/0.45 # Maximum resident set size: 1512 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.041 s
% 0.17/0.45 # System time : 0.005 s
% 0.17/0.45 # Total time : 0.046 s
% 0.17/0.45 # Maximum resident set size: 1668 pages
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------