TSTP Solution File: GRP679-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP679-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:08 EDT 2023
% Result : Timeout 0.35s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 4 RR)
% Number of literals : 18 ( 17 equ; 3 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
file('/export/starexec/sandbox/tmp/tmp.zeVIK5PSmr/E---3.1_14411.p',c07) ).
cnf(c08,axiom,
mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox/tmp/tmp.zeVIK5PSmr/E---3.1_14411.p',c08) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/tmp/tmp.zeVIK5PSmr/E---3.1_14411.p',c05) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.zeVIK5PSmr/E---3.1_14411.p',c06) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.zeVIK5PSmr/E---3.1_14411.p',c02) ).
cnf(goals,negated_conjecture,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
file('/export/starexec/sandbox/tmp/tmp.zeVIK5PSmr/E---3.1_14411.p',goals) ).
cnf(c_0_6,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
c07 ).
cnf(c_0_7,axiom,
mult(op_c,X1) = mult(X1,op_c),
c08 ).
cnf(c_0_8,plain,
mult(mult(op_c,mult(op_c,X1)),X2) = mult(op_c,mult(X1,mult(op_c,X2))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_10,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_11,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_12,negated_conjecture,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
goals ).
cnf(c_0_13,plain,
mult(mult(op_c,op_c),X1) = mult(op_c,mult(op_c,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_14,plain,
ld(op_c,mult(X1,op_c)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_15,negated_conjecture,
mult(a,mult(op_c,op_c)) != mult(op_c,mult(op_c,a)),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
mult(X1,mult(op_c,op_c)) = mult(op_c,mult(op_c,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_8]),c_0_11]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP679-1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 02:38:11 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/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/tmp/tmp.zeVIK5PSmr/E---3.1_14411.p
% 0.35/300.16 # Version: 3.1pre001
% 0.35/300.16 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.16 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/300.16 # Starting new_bool_3 with 300s (1) cores
% 0.35/300.16 # Starting new_bool_1 with 300s (1) cores
% 0.35/300.16 # Starting sh5l with 300s (1) cores
% 0.35/300.16 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 14573 completed with status 0
% 0.35/300.16 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.35/300.16 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.16 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/300.16 # No SInE strategy applied
% 0.35/300.16 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.35/300.16 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/300.16 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.35/300.16 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.35/300.16 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.35/300.16 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.35/300.16 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.35/300.16 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 14585 completed with status 0
% 0.35/300.16 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 0.35/300.16 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.16 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/300.16 # No SInE strategy applied
% 0.35/300.16 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.35/300.16 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/300.16 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.35/300.16 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.35/300.16 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.35/300.16 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.35/300.16 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.35/300.16 # Preprocessing time : 0.001 s
% 0.35/300.16
% 0.35/300.16 # Proof found!
% 0.35/300.16 # SZS status Unsatisfiable
% 0.35/300.16 # SZS output start CNFRefutation
% See solution above
% 0.35/300.16 # Parsed axioms : 9
% 0.35/300.16 # Removed by relevancy pruning/SinE : 0
% 0.35/300.16 # Initial clauses : 9
% 0.35/300.16 # Removed in clause preprocessing : 0
% 0.35/300.16 # Initial clauses in saturation : 9
% 0.35/300.16 # Processed clauses : 37
% 0.35/300.16 # ...of these trivial : 3
% 0.35/300.16 # ...subsumed : 7
% 0.35/300.16 # ...remaining for further processing : 27
% 0.35/300.16 # Other redundant clauses eliminated : 0
% 0.35/300.16 # Clauses deleted for lack of memory : 0
% 0.35/300.16 # Backward-subsumed : 0
% 0.35/300.16 # Backward-rewritten : 5
% 0.35/300.16 # Generated clauses : 151
% 0.35/300.16 # ...of the previous two non-redundant : 68
% 0.35/300.16 # ...aggressively subsumed : 0
% 0.35/300.16 # Contextual simplify-reflections : 0
% 0.35/300.16 # Paramodulations : 151
% 0.35/300.16 # Factorizations : 0
% 0.35/300.16 # NegExts : 0
% 0.35/300.16 # Equation resolutions : 0
% 0.35/300.16 # Total rewrite steps : 108
% 0.35/300.16 # Propositional unsat checks : 0
% 0.35/300.16 # Propositional check models : 0
% 0.35/300.16 # Propositional check unsatisfiable : 0
% 0.35/300.16 # Propositional clauses : 0
% 0.35/300.16 # Propositional clauses after purity: 0
% 0.35/300.16 # Propositional unsat core size : 0
% 0.35/300.16 # Propositional preprocessing time : 0.000
% 0.35/300.16 # Propositional encoding time : 0.000
% 0.35/300.16 # Propositional solver time : 0.000
% 0.35/300.16 # Success case prop preproc time : 0.000
% 0.35/300.16 # Success case prop encoding time : 0.000
% 0.35/300.16 # Success case prop solver time : 0.000
% 0.35/300.16 # Current number of processed clauses : 22
% 0.35/300.16 # Positive orientable unit clauses : 20
% 0.35/300.16 # Positive unorientable unit clauses: 2
% 0.35/300.16 # Negative unit clauses : 0
% 0.35/300.16 # Non-unit-clauses : 0
% 0.35/300.16 # Current number of unprocessed clauses: 36
% 0.35/300.16 # ...number of literals in the above : 36
% 0.35/300.16 # Current number of archived formulas : 0
% 0.35/300.16 # Current number of archived clauses : 5
% 0.35/300.16 # Clause-clause subsumption calls (NU) : 0
% 0.35/300.16 # Rec. Clause-clause subsumption calls : 0
% 0.35/300.16 # Non-unit clause-clause subsumptions : 0
% 0.35/300.16 # Unit Clause-clause subsumption calls : 1
% 0.35/300.16 # Rewrite failures with RHS unbound : 0
% 0.35/300.16 # BW rewrite match attempts : 16
% 0.35/300.16 # BW rewrite match successes : 9
% 0.35/300.16 # Condensation attempts : 0
% 0.35/300.16 # Condensation successes : 0
% 0.35/300.16 # Termbank termtop insertions : 1515
% 0.35/300.16
% 0.35/300.16 # -------------------------------------------------
% 0.35/300.16 # User time : 0.003 s
% 0.35/300.16 # System time : 0.003 s
% 0.35/300.16 # Total time : 0.006 s
% 0.35/300.16 # Maximum resident set size: 1508 pages
% 0.35/300.16
% 0.35/300.16 # -------------------------------------------------
% 0.35/300.16 # User time : 0.018 s
% 0.35/300.16 # System time : 0.012 s
% 0.35/300.16 # Total time : 0.030 s
% 0.35/300.16 # Maximum resident set size: 1668 pages
% 0.35/300.16 % E---3.1 exiting
%------------------------------------------------------------------------------