TSTP Solution File: SYN170-10 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN170-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 10:06:38 EDT 2024
% Result : Unsatisfiable 0.50s 0.58s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 9 RR)
% Number of literals : 19 ( 18 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 28 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_067,axiom,
ifeq(q0(X1,X2),true,p1(X2,X2,X2),true) = true,
file('/export/starexec/sandbox/tmp/tmp.0ddY4bqDOK/E---3.1_30592.p',rule_067) ).
cnf(axiom_33,axiom,
q0(d,c) = true,
file('/export/starexec/sandbox/tmp/tmp.0ddY4bqDOK/E---3.1_30592.p',axiom_33) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.0ddY4bqDOK/E---3.1_30592.p',ifeq_axiom) ).
cnf(rule_137,axiom,
ifeq(p1(X1,X2,X3),true,n2(X3),true) = true,
file('/export/starexec/sandbox/tmp/tmp.0ddY4bqDOK/E---3.1_30592.p',rule_137) ).
cnf(rule_210,axiom,
ifeq(n2(X1),true,k3(X1,X1,X1),true) = true,
file('/export/starexec/sandbox/tmp/tmp.0ddY4bqDOK/E---3.1_30592.p',rule_210) ).
cnf(prove_this,negated_conjecture,
p4(X1,c,X2) != true,
file('/export/starexec/sandbox/tmp/tmp.0ddY4bqDOK/E---3.1_30592.p',prove_this) ).
cnf(rule_287,axiom,
ifeq(k3(X1,X1,X2),true,p4(X1,X2,X1),true) = true,
file('/export/starexec/sandbox/tmp/tmp.0ddY4bqDOK/E---3.1_30592.p',rule_287) ).
cnf(c_0_7,axiom,
ifeq(q0(X1,X2),true,p1(X2,X2,X2),true) = true,
rule_067 ).
cnf(c_0_8,axiom,
q0(d,c) = true,
axiom_33 ).
cnf(c_0_9,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_10,axiom,
ifeq(p1(X1,X2,X3),true,n2(X3),true) = true,
rule_137 ).
cnf(c_0_11,plain,
p1(c,c,c) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,axiom,
ifeq(n2(X1),true,k3(X1,X1,X1),true) = true,
rule_210 ).
cnf(c_0_13,plain,
n2(c) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9]) ).
cnf(c_0_14,negated_conjecture,
p4(X1,c,X2) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_15,axiom,
ifeq(k3(X1,X1,X2),true,p4(X1,X2,X1),true) = true,
rule_287 ).
cnf(c_0_16,plain,
k3(c,c,c) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9]) ).
cnf(c_0_17,negated_conjecture,
p4(X1,c,X2) != true,
c_0_14 ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_9]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.15 % Problem : SYN170-10 : TPTP v8.1.2. Released v7.5.0.
% 0.12/0.17 % Command : run_E %s %d THM
% 0.17/0.37 % Computer : n013.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 300
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Fri May 3 10:32:04 EDT 2024
% 0.17/0.37 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.0ddY4bqDOK/E---3.1_30592.p
% 0.50/0.58 # Version: 3.1.0
% 0.50/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.58 # Starting sh5l with 300s (1) cores
% 0.50/0.58 # new_bool_3 with pid 30672 completed with status 0
% 0.50/0.58 # Result found by new_bool_3
% 0.50/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.58 # Search class: FUUPM-FFLM32-MFFFFFNN
% 0.50/0.58 # partial match(1): FUUPM-FFMM32-MFFFFFNN
% 0.50/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.58 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.50/0.58 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 30680 completed with status 0
% 0.50/0.58 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.50/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.58 # Search class: FUUPM-FFLM32-MFFFFFNN
% 0.50/0.58 # partial match(1): FUUPM-FFMM32-MFFFFFNN
% 0.50/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.58 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.50/0.58 # Preprocessing time : 0.005 s
% 0.50/0.58 # Presaturation interreduction done
% 0.50/0.58
% 0.50/0.58 # Proof found!
% 0.50/0.58 # SZS status Unsatisfiable
% 0.50/0.58 # SZS output start CNFRefutation
% See solution above
% 0.50/0.58 # Parsed axioms : 363
% 0.50/0.58 # Removed by relevancy pruning/SinE : 41
% 0.50/0.58 # Initial clauses : 322
% 0.50/0.58 # Removed in clause preprocessing : 0
% 0.50/0.58 # Initial clauses in saturation : 322
% 0.50/0.58 # Processed clauses : 451
% 0.50/0.58 # ...of these trivial : 23
% 0.50/0.58 # ...subsumed : 0
% 0.50/0.58 # ...remaining for further processing : 428
% 0.50/0.58 # Other redundant clauses eliminated : 0
% 0.50/0.58 # Clauses deleted for lack of memory : 0
% 0.50/0.58 # Backward-subsumed : 0
% 0.50/0.58 # Backward-rewritten : 5
% 0.50/0.58 # Generated clauses : 157
% 0.50/0.58 # ...of the previous two non-redundant : 121
% 0.50/0.58 # ...aggressively subsumed : 0
% 0.50/0.58 # Contextual simplify-reflections : 0
% 0.50/0.58 # Paramodulations : 157
% 0.50/0.58 # Factorizations : 0
% 0.50/0.58 # NegExts : 0
% 0.50/0.58 # Equation resolutions : 0
% 0.50/0.58 # Disequality decompositions : 0
% 0.50/0.58 # Total rewrite steps : 304
% 0.50/0.58 # ...of those cached : 145
% 0.50/0.58 # Propositional unsat checks : 0
% 0.50/0.58 # Propositional check models : 0
% 0.50/0.58 # Propositional check unsatisfiable : 0
% 0.50/0.58 # Propositional clauses : 0
% 0.50/0.58 # Propositional clauses after purity: 0
% 0.50/0.58 # Propositional unsat core size : 0
% 0.50/0.58 # Propositional preprocessing time : 0.000
% 0.50/0.58 # Propositional encoding time : 0.000
% 0.50/0.58 # Propositional solver time : 0.000
% 0.50/0.58 # Success case prop preproc time : 0.000
% 0.50/0.58 # Success case prop encoding time : 0.000
% 0.50/0.58 # Success case prop solver time : 0.000
% 0.50/0.58 # Current number of processed clauses : 119
% 0.50/0.58 # Positive orientable unit clauses : 118
% 0.50/0.58 # Positive unorientable unit clauses: 0
% 0.50/0.58 # Negative unit clauses : 1
% 0.50/0.58 # Non-unit-clauses : 0
% 0.50/0.58 # Current number of unprocessed clauses: 296
% 0.50/0.58 # ...number of literals in the above : 296
% 0.50/0.58 # Current number of archived formulas : 0
% 0.50/0.58 # Current number of archived clauses : 309
% 0.50/0.58 # Clause-clause subsumption calls (NU) : 0
% 0.50/0.58 # Rec. Clause-clause subsumption calls : 0
% 0.50/0.58 # Non-unit clause-clause subsumptions : 0
% 0.50/0.58 # Unit Clause-clause subsumption calls : 0
% 0.50/0.58 # Rewrite failures with RHS unbound : 0
% 0.50/0.58 # BW rewrite match attempts : 1200
% 0.50/0.58 # BW rewrite match successes : 5
% 0.50/0.58 # Condensation attempts : 0
% 0.50/0.58 # Condensation successes : 0
% 0.50/0.58 # Termbank termtop insertions : 13528
% 0.50/0.58 # Search garbage collected termcells : 198
% 0.50/0.58
% 0.50/0.58 # -------------------------------------------------
% 0.50/0.58 # User time : 0.025 s
% 0.50/0.58 # System time : 0.011 s
% 0.50/0.58 # Total time : 0.036 s
% 0.50/0.58 # Maximum resident set size: 2280 pages
% 0.50/0.58
% 0.50/0.58 # -------------------------------------------------
% 0.50/0.58 # User time : 0.032 s
% 0.50/0.58 # System time : 0.014 s
% 0.50/0.58 # Total time : 0.046 s
% 0.50/0.58 # Maximum resident set size: 1988 pages
% 0.50/0.58 % E---3.1 exiting
% 0.50/0.58 % E exiting
%------------------------------------------------------------------------------