TSTP Solution File: SYN221-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN221-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:49 EDT 2024
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 16 unt; 0 nHn; 32 RR)
% Number of literals : 61 ( 0 equ; 30 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 31 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_126) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(rule_190,axiom,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_190) ).
cnf(axiom_36,axiom,
q0(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_36) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_220,axiom,
( l3(X1,X1)
| ~ s2(X2)
| ~ l1(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_220) ).
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(prove_this,negated_conjecture,
~ l3(X1,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(c_0_10,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_11,plain,
( s1(X1)
| ~ p0(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_12,plain,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
inference(fof_simplification,[status(thm)],[rule_190]) ).
cnf(c_0_13,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
c_0_10 ).
cnf(c_0_14,axiom,
q0(a,b),
axiom_36 ).
cnf(c_0_15,plain,
( s1(X1)
| ~ p0(X1,X1) ),
c_0_11 ).
cnf(c_0_16,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_17,plain,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
c_0_12 ).
cnf(c_0_18,axiom,
s0(d),
axiom_1 ).
cnf(c_0_19,plain,
( s1(a)
| ~ s1(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
s1(b),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( l3(X1,X1)
| ~ s2(X2)
| ~ l1(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_220]) ).
cnf(c_0_22,plain,
( s2(d)
| ~ s1(a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_23,plain,
s1(a),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_25,negated_conjecture,
~ l3(X1,c),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_26,plain,
( l3(X1,X1)
| ~ s2(X2)
| ~ l1(X1,X1) ),
c_0_21 ).
cnf(c_0_27,plain,
s2(d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_28,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
c_0_24 ).
cnf(c_0_29,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_30,negated_conjecture,
~ l3(X1,c),
c_0_25 ).
cnf(c_0_31,plain,
( l3(X1,X1)
| ~ l1(X1,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
l1(c,c),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN221-1 : TPTP v8.2.0. Released v1.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 14:36:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.52 # Version: 3.1.0
% 0.19/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # new_bool_3 with pid 5544 completed with status 0
% 0.19/0.52 # Result found by new_bool_3
% 0.19/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.52 # SAT001_MinMin_p005000_rr_RG with pid 5552 completed with status 0
% 0.19/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.52 # Preprocessing time : 0.005 s
% 0.19/0.52 # Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Unsatisfiable
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 369
% 0.19/0.52 # Removed by relevancy pruning/SinE : 30
% 0.19/0.52 # Initial clauses : 339
% 0.19/0.52 # Removed in clause preprocessing : 6
% 0.19/0.52 # Initial clauses in saturation : 333
% 0.19/0.52 # Processed clauses : 475
% 0.19/0.52 # ...of these trivial : 14
% 0.19/0.52 # ...subsumed : 24
% 0.19/0.52 # ...remaining for further processing : 437
% 0.19/0.52 # Other redundant clauses eliminated : 0
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 10
% 0.19/0.52 # Backward-rewritten : 18
% 0.19/0.52 # Generated clauses : 76
% 0.19/0.52 # ...of the previous two non-redundant : 76
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 2
% 0.19/0.52 # Paramodulations : 76
% 0.19/0.52 # Factorizations : 0
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 0
% 0.19/0.52 # Disequality decompositions : 0
% 0.19/0.52 # Total rewrite steps : 101
% 0.19/0.52 # ...of those cached : 53
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 110
% 0.19/0.52 # Positive orientable unit clauses : 61
% 0.19/0.52 # Positive unorientable unit clauses: 0
% 0.19/0.52 # Negative unit clauses : 7
% 0.19/0.52 # Non-unit-clauses : 42
% 0.19/0.52 # Current number of unprocessed clauses: 230
% 0.19/0.52 # ...number of literals in the above : 681
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 327
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 19721
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 12707
% 0.19/0.52 # Non-unit clause-clause subsumptions : 29
% 0.19/0.52 # Unit Clause-clause subsumption calls : 69
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 17
% 0.19/0.52 # BW rewrite match successes : 14
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 12682
% 0.19/0.52 # Search garbage collected termcells : 1503
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.034 s
% 0.19/0.52 # System time : 0.008 s
% 0.19/0.52 # Total time : 0.042 s
% 0.19/0.52 # Maximum resident set size: 2636 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.039 s
% 0.19/0.52 # System time : 0.010 s
% 0.19/0.52 # Total time : 0.050 s
% 0.19/0.52 # Maximum resident set size: 2024 pages
% 0.19/0.52 % E---3.1 exiting
% 0.19/0.53 % E exiting
%------------------------------------------------------------------------------