TSTP Solution File: GRP680-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP680-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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:01:41 EDT 2024
% Result : Unsatisfiable 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 4 RR)
% Number of literals : 21 ( 20 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.HSqGLImbqc/E---3.1_32034.p',c02) ).
cnf(c09,axiom,
mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox2/tmp/tmp.HSqGLImbqc/E---3.1_32034.p',c09) ).
cnf(c08,axiom,
mult(i(X1),mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.HSqGLImbqc/E---3.1_32034.p',c08) ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
file('/export/starexec/sandbox2/tmp/tmp.HSqGLImbqc/E---3.1_32034.p',c07) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/tmp.HSqGLImbqc/E---3.1_32034.p',c05) ).
cnf(goals,negated_conjecture,
mult(i(op_c),a) != mult(a,i(op_c)),
file('/export/starexec/sandbox2/tmp/tmp.HSqGLImbqc/E---3.1_32034.p',goals) ).
cnf(c_0_6,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_7,axiom,
mult(op_c,X1) = mult(X1,op_c),
c09 ).
cnf(c_0_8,axiom,
mult(i(X1),mult(X1,X2)) = X2,
c08 ).
cnf(c_0_9,plain,
ld(op_c,mult(X1,op_c)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
mult(i(i(X1)),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_11,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
c07 ).
cnf(c_0_12,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_13,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_9]) ).
cnf(c_0_14,negated_conjecture,
mult(i(op_c),a) != mult(a,i(op_c)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_15,plain,
mult(op_c,mult(X1,mult(X2,X1))) = mult(X1,mult(X2,mult(X1,op_c))),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_16,plain,
mult(i(X1),X1) = unit,
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_17,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
mult(i(op_c),a) != mult(a,i(op_c)),
c_0_14 ).
cnf(c_0_19,plain,
mult(X1,i(op_c)) = mult(i(op_c),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_12]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP680-1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 16:20:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.HSqGLImbqc/E---3.1_32034.p
% 0.20/0.53 # Version: 3.1.0
% 0.20/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 32160 completed with status 0
% 0.20/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.53 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.53 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.20/0.53 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.20/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.20/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 32166 completed with status 0
% 0.20/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.53 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.53 # Preprocessing time : 0.002 s
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Unsatisfiable
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 10
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 10
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 10
% 0.20/0.53 # Processed clauses : 97
% 0.20/0.53 # ...of these trivial : 17
% 0.20/0.53 # ...subsumed : 19
% 0.20/0.53 # ...remaining for further processing : 61
% 0.20/0.53 # Other redundant clauses eliminated : 0
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 0
% 0.20/0.53 # Backward-rewritten : 20
% 0.20/0.53 # Generated clauses : 865
% 0.20/0.53 # ...of the previous two non-redundant : 547
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 0
% 0.20/0.53 # Paramodulations : 865
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 0
% 0.20/0.53 # Disequality decompositions : 0
% 0.20/0.53 # Total rewrite steps : 926
% 0.20/0.53 # ...of those cached : 664
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 41
% 0.20/0.53 # Positive orientable unit clauses : 38
% 0.20/0.53 # Positive unorientable unit clauses: 3
% 0.20/0.53 # Negative unit clauses : 0
% 0.20/0.53 # Non-unit-clauses : 0
% 0.20/0.53 # Current number of unprocessed clauses: 429
% 0.20/0.53 # ...number of literals in the above : 429
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 20
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.53 # Non-unit clause-clause subsumptions : 0
% 0.20/0.53 # Unit Clause-clause subsumption calls : 2
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 49
% 0.20/0.53 # BW rewrite match successes : 26
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 9993
% 0.20/0.53 # Search garbage collected termcells : 2
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.018 s
% 0.20/0.53 # System time : 0.005 s
% 0.20/0.53 # Total time : 0.023 s
% 0.20/0.53 # Maximum resident set size: 1556 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.100 s
% 0.20/0.53 # System time : 0.015 s
% 0.20/0.53 # Total time : 0.116 s
% 0.20/0.53 # Maximum resident set size: 1692 pages
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------