TSTP Solution File: SYN113-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN113-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Tue May 21 07:43:25 EDT 2024
% Result : Unsatisfiable 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 13 unt; 0 nHn; 22 RR)
% Number of literals : 55 ( 0 equ; 29 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 43 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_005,axiom,
( m1(X1,X2,X1)
| ~ m0(X2,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_005) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_107) ).
cnf(rule_127,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_127) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_129) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(prove_this,negated_conjecture,
~ k2(e,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_8,plain,
( m1(X1,X2,X1)
| ~ m0(X2,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_005]) ).
cnf(c_0_9,plain,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
inference(fof_simplification,[status(thm)],[rule_107]) ).
cnf(c_0_10,plain,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
inference(fof_simplification,[status(thm)],[rule_127]) ).
cnf(c_0_11,plain,
( m1(X1,X2,X1)
| ~ m0(X2,X2,X1) ),
c_0_8 ).
cnf(c_0_12,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_13,plain,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_14,plain,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
c_0_9 ).
cnf(c_0_15,plain,
( k1(X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_16,plain,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
c_0_10 ).
cnf(c_0_17,plain,
m1(X1,d,X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
c_0_13 ).
cnf(c_0_19,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_12]),c_0_12])]) ).
cnf(c_0_20,plain,
( k1(X1)
| ~ n0(X2,X1) ),
c_0_15 ).
cnf(c_0_21,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_22,negated_conjecture,
~ k2(e,d),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_23,plain,
( k2(X1,d)
| ~ k2(X2,d)
| ~ k1(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
k1(d),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
~ k2(e,d),
c_0_22 ).
cnf(c_0_27,plain,
k2(X1,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : SYN113-1 : TPTP v8.2.0. Released v1.1.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 15:40:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/benchmark/theBenchmark.p
% 0.21/0.55 # Version: 3.1.0
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # new_bool_3 with pid 2731 completed with status 0
% 0.21/0.55 # Result found by new_bool_3
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.55 # SAT001_MinMin_p005000_rr_RG with pid 2737 completed with status 0
% 0.21/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.55 # Preprocessing time : 0.005 s
% 0.21/0.55 # Presaturation interreduction done
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Unsatisfiable
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 369
% 0.21/0.55 # Removed by relevancy pruning/SinE : 41
% 0.21/0.55 # Initial clauses : 328
% 0.21/0.55 # Removed in clause preprocessing : 5
% 0.21/0.55 # Initial clauses in saturation : 323
% 0.21/0.55 # Processed clauses : 678
% 0.21/0.55 # ...of these trivial : 19
% 0.21/0.55 # ...subsumed : 23
% 0.21/0.55 # ...remaining for further processing : 636
% 0.21/0.55 # Other redundant clauses eliminated : 0
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 12
% 0.21/0.55 # Backward-rewritten : 55
% 0.21/0.55 # Generated clauses : 500
% 0.21/0.55 # ...of the previous two non-redundant : 329
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 1
% 0.21/0.55 # Paramodulations : 500
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 0
% 0.21/0.55 # Disequality decompositions : 0
% 0.21/0.55 # Total rewrite steps : 395
% 0.21/0.55 # ...of those cached : 264
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 280
% 0.21/0.55 # Positive orientable unit clauses : 118
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 0
% 0.21/0.55 # Non-unit-clauses : 162
% 0.21/0.55 # Current number of unprocessed clauses: 245
% 0.21/0.55 # ...number of literals in the above : 611
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 356
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 24710
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 17707
% 0.21/0.55 # Non-unit clause-clause subsumptions : 31
% 0.21/0.55 # Unit Clause-clause subsumption calls : 399
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 92
% 0.21/0.55 # BW rewrite match successes : 52
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 17005
% 0.21/0.55 # Search garbage collected termcells : 1516
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.049 s
% 0.21/0.55 # System time : 0.005 s
% 0.21/0.55 # Total time : 0.054 s
% 0.21/0.55 # Maximum resident set size: 2600 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.054 s
% 0.21/0.55 # System time : 0.009 s
% 0.21/0.55 # Total time : 0.063 s
% 0.21/0.55 # Maximum resident set size: 2016 pages
% 0.21/0.55 % E---3.1 exiting
% 0.21/0.55 % E exiting
%------------------------------------------------------------------------------