TSTP Solution File: SYN207-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN207-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:46 EDT 2024
% Result : Unsatisfiable 0.50s 0.58s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 59 ( 24 unt; 0 nHn; 48 RR)
% Number of literals : 121 ( 0 equ; 67 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 88 ( 36 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_093,axiom,
( q1(X1,X1,X1)
| ~ q0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_093) ).
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_184,axiom,
( q2(X1,X1,X1)
| ~ q1(X2,c,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_184) ).
cnf(axiom_33,axiom,
q0(d,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_33) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_273,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_273) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_133) ).
cnf(prove_this,negated_conjecture,
~ s3(c,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_189,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_189) ).
cnf(rule_183,axiom,
( q2(X1,c,X2)
| ~ k1(X2)
| ~ l0(c)
| ~ l2(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_183) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
cnf(c_0_16,plain,
( q1(X1,X1,X1)
| ~ q0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_093]) ).
cnf(c_0_17,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_18,plain,
( s1(X1)
| ~ p0(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_19,plain,
( q2(X1,X1,X1)
| ~ q1(X2,c,X1) ),
inference(fof_simplification,[status(thm)],[rule_184]) ).
cnf(c_0_20,plain,
( q1(X1,X1,X1)
| ~ q0(X2,X1) ),
c_0_16 ).
cnf(c_0_21,axiom,
q0(d,c),
axiom_33 ).
cnf(c_0_22,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
c_0_17 ).
cnf(c_0_23,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_24,plain,
( s1(X1)
| ~ p0(X1,X1) ),
c_0_18 ).
cnf(c_0_25,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_26,plain,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_27,plain,
( q2(X1,X1,X1)
| ~ q1(X2,c,X1) ),
c_0_19 ).
cnf(c_0_28,plain,
q1(c,c,c),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_30,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
s1(b),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
c_0_26 ).
cnf(c_0_33,plain,
q2(c,c,c),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
c_0_29 ).
cnf(c_0_35,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
~ s3(c,c),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_37,plain,
( s3(c,X1)
| ~ s2(c)
| ~ m0(c,X2,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_39,plain,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
inference(fof_simplification,[status(thm)],[rule_189]) ).
cnf(c_0_40,plain,
( q2(X1,c,X2)
| ~ k1(X2)
| ~ l0(c)
| ~ l2(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_183]) ).
cnf(c_0_41,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_42,negated_conjecture,
~ s3(c,c),
c_0_36 ).
cnf(c_0_43,plain,
( s3(c,X1)
| ~ s2(c) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
c_0_39 ).
cnf(c_0_45,plain,
( q2(X1,c,X2)
| ~ k1(X2)
| ~ l0(c)
| ~ l2(X2,X1) ),
c_0_40 ).
cnf(c_0_46,axiom,
l0(c),
axiom_24 ).
cnf(c_0_47,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_48,plain,
( k1(X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_49,negated_conjecture,
~ s2(c),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( s2(X1)
| ~ q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_31])]) ).
cnf(c_0_51,plain,
( q2(X1,c,X2)
| ~ l2(X2,X1)
| ~ k1(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_52,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_47,c_0_25]) ).
cnf(c_0_53,plain,
( k1(X1)
| ~ n0(X2,X1) ),
c_0_48 ).
cnf(c_0_54,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_55,negated_conjecture,
~ q2(b,c,b),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,plain,
( q2(X1,c,X1)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,plain,
k1(b),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN207-1 : TPTP v8.2.0. Released v1.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 15:50:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.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 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 21150 completed with status 0
% 0.50/0.58 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 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 # No SInE strategy applied
% 0.50/0.58 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.50/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.50/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.50/0.58 # Starting new_bool_3 with 136s (1) cores
% 0.50/0.58 # Starting new_bool_1 with 136s (1) cores
% 0.50/0.58 # Starting sh5l with 136s (1) cores
% 0.50/0.58 # SAT001_MinMin_p005000_rr_RG with pid 21155 completed with status 0
% 0.50/0.58 # Result found by SAT001_MinMin_p005000_rr_RG
% 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 # No SInE strategy applied
% 0.50/0.58 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.50/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.50/0.58 # Preprocessing time : 0.003 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 : 369
% 0.50/0.58 # Removed by relevancy pruning/SinE : 0
% 0.50/0.58 # Initial clauses : 369
% 0.50/0.58 # Removed in clause preprocessing : 7
% 0.50/0.58 # Initial clauses in saturation : 362
% 0.50/0.58 # Processed clauses : 1250
% 0.50/0.58 # ...of these trivial : 71
% 0.50/0.58 # ...subsumed : 71
% 0.50/0.58 # ...remaining for further processing : 1108
% 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 : 70
% 0.50/0.58 # Backward-rewritten : 298
% 0.50/0.58 # Generated clauses : 1707
% 0.50/0.58 # ...of the previous two non-redundant : 1250
% 0.50/0.58 # ...aggressively subsumed : 0
% 0.50/0.58 # Contextual simplify-reflections : 2
% 0.50/0.58 # Paramodulations : 1707
% 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 : 1185
% 0.50/0.58 # ...of those cached : 850
% 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 : 412
% 0.50/0.58 # Positive orientable unit clauses : 203
% 0.50/0.58 # Positive unorientable unit clauses: 0
% 0.50/0.58 # Negative unit clauses : 3
% 0.50/0.58 # Non-unit-clauses : 206
% 0.50/0.58 # Current number of unprocessed clauses: 470
% 0.50/0.58 # ...number of literals in the above : 1393
% 0.50/0.58 # Current number of archived formulas : 0
% 0.50/0.58 # Current number of archived clauses : 696
% 0.50/0.58 # Clause-clause subsumption calls (NU) : 56143
% 0.50/0.58 # Rec. Clause-clause subsumption calls : 40200
% 0.50/0.58 # Non-unit clause-clause subsumptions : 113
% 0.50/0.58 # Unit Clause-clause subsumption calls : 4557
% 0.50/0.58 # Rewrite failures with RHS unbound : 0
% 0.50/0.58 # BW rewrite match attempts : 590
% 0.50/0.58 # BW rewrite match successes : 193
% 0.50/0.58 # Condensation attempts : 0
% 0.50/0.58 # Condensation successes : 0
% 0.50/0.58 # Termbank termtop insertions : 31531
% 0.50/0.58 # Search garbage collected termcells : 1461
% 0.50/0.58
% 0.50/0.58 # -------------------------------------------------
% 0.50/0.58 # User time : 0.060 s
% 0.50/0.58 # System time : 0.004 s
% 0.50/0.58 # Total time : 0.064 s
% 0.50/0.58 # Maximum resident set size: 2636 pages
% 0.50/0.58
% 0.50/0.58 # -------------------------------------------------
% 0.50/0.58 # User time : 0.371 s
% 0.50/0.58 # System time : 0.010 s
% 0.50/0.58 # Total time : 0.382 s
% 0.50/0.58 # Maximum resident set size: 2020 pages
% 0.50/0.58 % E---3.1 exiting
% 0.50/0.59 % E exiting
%------------------------------------------------------------------------------