TSTP Solution File: GRP710-10 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP710-10 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:43:01 EDT 2023
% Result : Unsatisfiable 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 4 RR)
% Number of literals : 25 ( 24 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 : 36 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f01,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/tmp/tmp.aOBcUBIGG2/E---3.1_12426.p',f01) ).
cnf(f03,axiom,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
file('/export/starexec/sandbox/tmp/tmp.aOBcUBIGG2/E---3.1_12426.p',f03) ).
cnf(f05,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox/tmp/tmp.aOBcUBIGG2/E---3.1_12426.p',f05) ).
cnf(f02,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.aOBcUBIGG2/E---3.1_12426.p',f02) ).
cnf(f04,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox/tmp/tmp.aOBcUBIGG2/E---3.1_12426.p',f04) ).
cnf(goal,negated_conjecture,
mult(x0,X1) != x1,
file('/export/starexec/sandbox/tmp/tmp.aOBcUBIGG2/E---3.1_12426.p',goal) ).
cnf(c_0_6,axiom,
mult(X1,unit) = X1,
f01 ).
cnf(c_0_7,axiom,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
f03 ).
cnf(c_0_8,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).
cnf(c_0_9,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
mult(i(X1),X1) = unit,
f05 ).
cnf(c_0_11,axiom,
mult(unit,X1) = X1,
f02 ).
cnf(c_0_12,axiom,
mult(X1,i(X1)) = unit,
f04 ).
cnf(c_0_13,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,plain,
mult(X1,mult(i(X1),i(X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_11]) ).
cnf(c_0_15,plain,
mult(i(X1),mult(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_10]),c_0_11]) ).
cnf(c_0_16,plain,
i(mult(X1,X1)) = mult(i(X1),i(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]),c_0_6]) ).
cnf(c_0_17,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_11]) ).
cnf(c_0_18,plain,
mult(i(X1),mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_19,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_16]),c_0_17]),c_0_18]) ).
cnf(c_0_20,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_10]),c_0_6]) ).
cnf(c_0_21,negated_conjecture,
mult(x0,X1) != x1,
goal ).
cnf(c_0_22,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
X1 != x1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : GRP710-10 : TPTP v8.1.2. Released v8.1.0.
% 0.02/0.09 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n014.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 2400
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Tue Oct 3 02:57:19 EDT 2023
% 0.09/0.28 % CPUTime :
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.aOBcUBIGG2/E---3.1_12426.p
% 0.13/0.40 # Version: 3.1pre001
% 0.13/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.40 # Starting sh5l with 300s (1) cores
% 0.13/0.40 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 12511 completed with status 0
% 0.13/0.40 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.13/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.40 # No SInE strategy applied
% 0.13/0.40 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.13/0.40 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.40 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.13/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/0.40 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.13/0.40 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.13/0.40 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.13/0.40 # U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 12519 completed with status 0
% 0.13/0.40 # Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.13/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.40 # No SInE strategy applied
% 0.13/0.40 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.13/0.40 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.40 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.13/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/0.40 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.13/0.40 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.13/0.40 # Preprocessing time : 0.001 s
% 0.13/0.40
% 0.13/0.40 # Proof found!
% 0.13/0.40 # SZS status Unsatisfiable
% 0.13/0.40 # SZS output start CNFRefutation
% See solution above
% 0.13/0.40 # Parsed axioms : 6
% 0.13/0.40 # Removed by relevancy pruning/SinE : 0
% 0.13/0.40 # Initial clauses : 6
% 0.13/0.40 # Removed in clause preprocessing : 0
% 0.13/0.40 # Initial clauses in saturation : 6
% 0.13/0.40 # Processed clauses : 31
% 0.13/0.40 # ...of these trivial : 2
% 0.13/0.40 # ...subsumed : 2
% 0.13/0.40 # ...remaining for further processing : 27
% 0.13/0.40 # Other redundant clauses eliminated : 0
% 0.13/0.40 # Clauses deleted for lack of memory : 0
% 0.13/0.40 # Backward-subsumed : 2
% 0.13/0.40 # Backward-rewritten : 7
% 0.13/0.40 # Generated clauses : 252
% 0.13/0.40 # ...of the previous two non-redundant : 151
% 0.13/0.40 # ...aggressively subsumed : 0
% 0.13/0.40 # Contextual simplify-reflections : 0
% 0.13/0.40 # Paramodulations : 251
% 0.13/0.40 # Factorizations : 0
% 0.13/0.40 # NegExts : 0
% 0.13/0.40 # Equation resolutions : 1
% 0.13/0.40 # Total rewrite steps : 421
% 0.13/0.40 # Propositional unsat checks : 0
% 0.13/0.40 # Propositional check models : 0
% 0.13/0.40 # Propositional check unsatisfiable : 0
% 0.13/0.40 # Propositional clauses : 0
% 0.13/0.40 # Propositional clauses after purity: 0
% 0.13/0.40 # Propositional unsat core size : 0
% 0.13/0.40 # Propositional preprocessing time : 0.000
% 0.13/0.40 # Propositional encoding time : 0.000
% 0.13/0.40 # Propositional solver time : 0.000
% 0.13/0.40 # Success case prop preproc time : 0.000
% 0.13/0.40 # Success case prop encoding time : 0.000
% 0.13/0.40 # Success case prop solver time : 0.000
% 0.13/0.40 # Current number of processed clauses : 18
% 0.13/0.40 # Positive orientable unit clauses : 15
% 0.13/0.40 # Positive unorientable unit clauses: 0
% 0.13/0.40 # Negative unit clauses : 3
% 0.13/0.40 # Non-unit-clauses : 0
% 0.13/0.40 # Current number of unprocessed clauses: 116
% 0.13/0.40 # ...number of literals in the above : 116
% 0.13/0.40 # Current number of archived formulas : 0
% 0.13/0.40 # Current number of archived clauses : 9
% 0.13/0.40 # Clause-clause subsumption calls (NU) : 0
% 0.13/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.13/0.40 # Non-unit clause-clause subsumptions : 0
% 0.13/0.40 # Unit Clause-clause subsumption calls : 8
% 0.13/0.40 # Rewrite failures with RHS unbound : 0
% 0.13/0.40 # BW rewrite match attempts : 11
% 0.13/0.40 # BW rewrite match successes : 6
% 0.13/0.40 # Condensation attempts : 0
% 0.13/0.40 # Condensation successes : 0
% 0.13/0.40 # Termbank termtop insertions : 2725
% 0.13/0.40
% 0.13/0.40 # -------------------------------------------------
% 0.13/0.40 # User time : 0.004 s
% 0.13/0.40 # System time : 0.000 s
% 0.13/0.40 # Total time : 0.004 s
% 0.13/0.40 # Maximum resident set size: 1504 pages
% 0.13/0.40
% 0.13/0.40 # -------------------------------------------------
% 0.13/0.40 # User time : 0.015 s
% 0.13/0.40 # System time : 0.007 s
% 0.13/0.40 # Total time : 0.022 s
% 0.13/0.40 # Maximum resident set size: 1668 pages
% 0.13/0.40 % E---3.1 exiting
% 0.13/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------