TSTP Solution File: SYN211-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN211-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:42 EDT 2024
% Result : Unsatisfiable 0.21s 0.57s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 11 unt; 0 nHn; 25 RR)
% Number of literals : 47 ( 0 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 40 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_067,axiom,
( p1(X1,X1,X1)
| ~ q0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.cjJOIj6Fl6/E---3.1_22369.p',rule_067) ).
cnf(rule_299,axiom,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.cjJOIj6Fl6/E---3.1_22369.p',rule_299) ).
cnf(rule_244,axiom,
( p3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.cjJOIj6Fl6/E---3.1_22369.p',rule_244) ).
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.cjJOIj6Fl6/E---3.1_22369.p',rule_002) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.cjJOIj6Fl6/E---3.1_22369.p',rule_137) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/tmp/tmp.cjJOIj6Fl6/E---3.1_22369.p',axiom_17) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox2/tmp/tmp.cjJOIj6Fl6/E---3.1_22369.p',axiom_34) ).
cnf(prove_this,negated_conjecture,
~ s4(d),
file('/export/starexec/sandbox2/tmp/tmp.cjJOIj6Fl6/E---3.1_22369.p',prove_this) ).
cnf(c_0_8,plain,
( p1(X1,X1,X1)
| ~ q0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_067]) ).
cnf(c_0_9,plain,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
inference(fof_simplification,[status(thm)],[rule_299]) ).
cnf(c_0_10,plain,
( p3(X1,X1,X1)
| ~ n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_244]) ).
cnf(c_0_11,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_12,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_13,plain,
( p1(X1,X1,X1)
| ~ q0(X2,X1) ),
c_0_8 ).
cnf(c_0_14,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_15,plain,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
c_0_9 ).
cnf(c_0_16,plain,
( p3(X1,X1,X1)
| ~ n2(X1) ),
c_0_10 ).
cnf(c_0_17,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
c_0_11 ).
cnf(c_0_18,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_19,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
c_0_12 ).
cnf(c_0_20,plain,
p1(d,d,d),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ s4(d),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_22,plain,
( s4(X1)
| ~ n2(X2)
| ~ l1(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
l1(d,d),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
n2(d),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ s4(d),
c_0_21 ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYN211-1 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.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 : Fri May 3 10:56:04 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.cjJOIj6Fl6/E---3.1_22369.p
% 0.21/0.57 # Version: 3.1.0
% 0.21/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.57 # Starting sh5l with 300s (1) cores
% 0.21/0.57 # new_bool_3 with pid 22466 completed with status 0
% 0.21/0.57 # Result found by new_bool_3
% 0.21/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.57 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.57 # SAT001_MinMin_p005000_rr_RG with pid 22472 completed with status 0
% 0.21/0.57 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.57 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.57 # Preprocessing time : 0.004 s
% 0.21/0.57 # Presaturation interreduction done
% 0.21/0.57
% 0.21/0.57 # Proof found!
% 0.21/0.57 # SZS status Unsatisfiable
% 0.21/0.57 # SZS output start CNFRefutation
% See solution above
% 0.21/0.57 # Parsed axioms : 369
% 0.21/0.57 # Removed by relevancy pruning/SinE : 77
% 0.21/0.57 # Initial clauses : 292
% 0.21/0.57 # Removed in clause preprocessing : 5
% 0.21/0.57 # Initial clauses in saturation : 287
% 0.21/0.57 # Processed clauses : 465
% 0.21/0.57 # ...of these trivial : 17
% 0.21/0.57 # ...subsumed : 21
% 0.21/0.57 # ...remaining for further processing : 427
% 0.21/0.57 # Other redundant clauses eliminated : 0
% 0.21/0.57 # Clauses deleted for lack of memory : 0
% 0.21/0.57 # Backward-subsumed : 6
% 0.21/0.57 # Backward-rewritten : 24
% 0.21/0.57 # Generated clauses : 171
% 0.21/0.57 # ...of the previous two non-redundant : 121
% 0.21/0.57 # ...aggressively subsumed : 0
% 0.21/0.57 # Contextual simplify-reflections : 1
% 0.21/0.57 # Paramodulations : 171
% 0.21/0.57 # Factorizations : 0
% 0.21/0.57 # NegExts : 0
% 0.21/0.57 # Equation resolutions : 0
% 0.21/0.57 # Disequality decompositions : 0
% 0.21/0.57 # Total rewrite steps : 153
% 0.21/0.57 # ...of those cached : 86
% 0.21/0.57 # Propositional unsat checks : 0
% 0.21/0.57 # Propositional check models : 0
% 0.21/0.57 # Propositional check unsatisfiable : 0
% 0.21/0.57 # Propositional clauses : 0
% 0.21/0.57 # Propositional clauses after purity: 0
% 0.21/0.57 # Propositional unsat core size : 0
% 0.21/0.57 # Propositional preprocessing time : 0.000
% 0.21/0.57 # Propositional encoding time : 0.000
% 0.21/0.57 # Propositional solver time : 0.000
% 0.21/0.57 # Success case prop preproc time : 0.000
% 0.21/0.57 # Success case prop encoding time : 0.000
% 0.21/0.57 # Success case prop solver time : 0.000
% 0.21/0.57 # Current number of processed clauses : 143
% 0.21/0.57 # Positive orientable unit clauses : 77
% 0.21/0.57 # Positive unorientable unit clauses: 0
% 0.21/0.57 # Negative unit clauses : 1
% 0.21/0.57 # Non-unit-clauses : 65
% 0.21/0.57 # Current number of unprocessed clauses: 188
% 0.21/0.57 # ...number of literals in the above : 536
% 0.21/0.57 # Current number of archived formulas : 0
% 0.21/0.57 # Current number of archived clauses : 284
% 0.21/0.57 # Clause-clause subsumption calls (NU) : 14693
% 0.21/0.57 # Rec. Clause-clause subsumption calls : 10275
% 0.21/0.57 # Non-unit clause-clause subsumptions : 26
% 0.21/0.57 # Unit Clause-clause subsumption calls : 138
% 0.21/0.57 # Rewrite failures with RHS unbound : 0
% 0.21/0.57 # BW rewrite match attempts : 42
% 0.21/0.57 # BW rewrite match successes : 24
% 0.21/0.57 # Condensation attempts : 0
% 0.21/0.57 # Condensation successes : 0
% 0.21/0.57 # Termbank termtop insertions : 12116
% 0.21/0.57 # Search garbage collected termcells : 1553
% 0.21/0.57
% 0.21/0.57 # -------------------------------------------------
% 0.21/0.57 # User time : 0.032 s
% 0.21/0.57 # System time : 0.003 s
% 0.21/0.57 # Total time : 0.035 s
% 0.21/0.57 # Maximum resident set size: 2544 pages
% 0.21/0.57
% 0.21/0.57 # -------------------------------------------------
% 0.21/0.57 # User time : 0.038 s
% 0.21/0.57 # System time : 0.004 s
% 0.21/0.57 # Total time : 0.042 s
% 0.21/0.57 # Maximum resident set size: 2016 pages
% 0.21/0.57 % E---3.1 exiting
% 0.21/0.57 % E exiting
%------------------------------------------------------------------------------