TSTP Solution File: GRP665-10 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP665-10 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:42:40 EDT 2023
% Result : Unsatisfiable 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 5 RR)
% Number of literals : 17 ( 16 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1),
file('/export/starexec/sandbox/tmp/tmp.ftJMNouHZG/E---3.1_3369.p',goal) ).
cnf(f09,axiom,
mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox/tmp/tmp.ftJMNouHZG/E---3.1_3369.p',f09) ).
cnf(f07,axiom,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.ftJMNouHZG/E---3.1_3369.p',f07) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.ftJMNouHZG/E---3.1_3369.p',f04) ).
cnf(f08,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
file('/export/starexec/sandbox/tmp/tmp.ftJMNouHZG/E---3.1_3369.p',f08) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.ftJMNouHZG/E---3.1_3369.p',f02) ).
cnf(c_0_6,negated_conjecture,
mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1),
goal ).
cnf(c_0_7,axiom,
mult(op_c,X1) = mult(X1,op_c),
f09 ).
cnf(c_0_8,axiom,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
f07 ).
cnf(c_0_9,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_10,negated_conjecture,
mult(mult(x0,op_c),x1) != mult(op_c,mult(x0,x1)),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
mult(X1,mult(op_c,X2)) = mult(op_c,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_9]) ).
cnf(c_0_12,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
f08 ).
cnf(c_0_13,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_14,negated_conjecture,
mult(mult(x0,op_c),x1) != mult(x0,mult(x1,op_c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_7]) ).
cnf(c_0_15,plain,
mult(mult(X1,op_c),X2) = mult(op_c,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_7]),c_0_13]),c_0_7]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_11]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP665-10 : TPTP v8.1.2. Released v8.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:22:44 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 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.ftJMNouHZG/E---3.1_3369.p
% 0.20/0.47 # Version: 3.1pre001
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.47 # Starting sh5l with 300s (1) cores
% 0.20/0.47 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3496 completed with status 0
% 0.20/0.47 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # No SInE strategy applied
% 0.20/0.47 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.20/0.47 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.47 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.47 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.47 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.47 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.20/0.47 # U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 3505 completed with status 0
% 0.20/0.47 # Result found by U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # No SInE strategy applied
% 0.20/0.47 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.20/0.47 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.47 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.47 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.47 # Preprocessing time : 0.001 s
% 0.20/0.47 # Presaturation interreduction done
% 0.20/0.47
% 0.20/0.47 # Proof found!
% 0.20/0.47 # SZS status Unsatisfiable
% 0.20/0.47 # SZS output start CNFRefutation
% See solution above
% 0.20/0.47 # Parsed axioms : 10
% 0.20/0.47 # Removed by relevancy pruning/SinE : 0
% 0.20/0.47 # Initial clauses : 10
% 0.20/0.47 # Removed in clause preprocessing : 0
% 0.20/0.47 # Initial clauses in saturation : 10
% 0.20/0.47 # Processed clauses : 53
% 0.20/0.47 # ...of these trivial : 9
% 0.20/0.47 # ...subsumed : 6
% 0.20/0.47 # ...remaining for further processing : 38
% 0.20/0.47 # Other redundant clauses eliminated : 0
% 0.20/0.47 # Clauses deleted for lack of memory : 0
% 0.20/0.47 # Backward-subsumed : 0
% 0.20/0.47 # Backward-rewritten : 5
% 0.20/0.47 # Generated clauses : 203
% 0.20/0.47 # ...of the previous two non-redundant : 117
% 0.20/0.47 # ...aggressively subsumed : 0
% 0.20/0.47 # Contextual simplify-reflections : 0
% 0.20/0.47 # Paramodulations : 203
% 0.20/0.47 # Factorizations : 0
% 0.20/0.47 # NegExts : 0
% 0.20/0.47 # Equation resolutions : 0
% 0.20/0.47 # Total rewrite steps : 145
% 0.20/0.47 # Propositional unsat checks : 0
% 0.20/0.47 # Propositional check models : 0
% 0.20/0.47 # Propositional check unsatisfiable : 0
% 0.20/0.47 # Propositional clauses : 0
% 0.20/0.47 # Propositional clauses after purity: 0
% 0.20/0.47 # Propositional unsat core size : 0
% 0.20/0.47 # Propositional preprocessing time : 0.000
% 0.20/0.47 # Propositional encoding time : 0.000
% 0.20/0.47 # Propositional solver time : 0.000
% 0.20/0.47 # Success case prop preproc time : 0.000
% 0.20/0.47 # Success case prop encoding time : 0.000
% 0.20/0.47 # Success case prop solver time : 0.000
% 0.20/0.47 # Current number of processed clauses : 23
% 0.20/0.47 # Positive orientable unit clauses : 21
% 0.20/0.47 # Positive unorientable unit clauses: 2
% 0.20/0.47 # Negative unit clauses : 0
% 0.20/0.47 # Non-unit-clauses : 0
% 0.20/0.47 # Current number of unprocessed clauses: 78
% 0.20/0.47 # ...number of literals in the above : 78
% 0.20/0.47 # Current number of archived formulas : 0
% 0.20/0.47 # Current number of archived clauses : 15
% 0.20/0.47 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.47 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.47 # Non-unit clause-clause subsumptions : 0
% 0.20/0.47 # Unit Clause-clause subsumption calls : 0
% 0.20/0.47 # Rewrite failures with RHS unbound : 0
% 0.20/0.47 # BW rewrite match attempts : 10
% 0.20/0.47 # BW rewrite match successes : 4
% 0.20/0.47 # Condensation attempts : 0
% 0.20/0.47 # Condensation successes : 0
% 0.20/0.47 # Termbank termtop insertions : 1868
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.005 s
% 0.20/0.47 # System time : 0.001 s
% 0.20/0.47 # Total time : 0.006 s
% 0.20/0.47 # Maximum resident set size: 1516 pages
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.025 s
% 0.20/0.47 # System time : 0.006 s
% 0.20/0.47 # Total time : 0.031 s
% 0.20/0.47 # Maximum resident set size: 1672 pages
% 0.20/0.47 % E---3.1 exiting
% 0.20/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------