TSTP Solution File: SYN117-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN117-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:26 EDT 2024
% Result : Unsatisfiable 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 49 ( 21 unt; 0 nHn; 46 RR)
% Number of literals : 89 ( 0 equ; 45 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 62 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_107) ).
cnf(rule_090,axiom,
( p1(e,e,e)
| ~ r0(e)
| ~ k0(e) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_090) ).
cnf(rule_154,axiom,
( p2(X1,X1,X1)
| ~ q1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_154) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(rule_267,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_267) ).
cnf(rule_244,axiom,
( p3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_244) ).
cnf(rule_300,axiom,
( k5(X1)
| ~ s4(X2)
| ~ r3(X3,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_300) ).
cnf(prove_this,negated_conjecture,
~ k5(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_299,axiom,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_299) ).
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(c_0_14,plain,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
inference(fof_simplification,[status(thm)],[rule_107]) ).
cnf(c_0_15,plain,
( p1(e,e,e)
| ~ r0(e)
| ~ k0(e) ),
inference(fof_simplification,[status(thm)],[rule_090]) ).
cnf(c_0_16,plain,
( p2(X1,X1,X1)
| ~ q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_154]) ).
cnf(c_0_17,plain,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
c_0_14 ).
cnf(c_0_18,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_19,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_20,plain,
( p1(e,e,e)
| ~ r0(e)
| ~ k0(e) ),
c_0_15 ).
cnf(c_0_21,axiom,
r0(e),
axiom_13 ).
cnf(c_0_22,axiom,
k0(e),
axiom_28 ).
cnf(c_0_23,plain,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
inference(fof_simplification,[status(thm)],[rule_267]) ).
cnf(c_0_24,plain,
( p2(X1,X1,X1)
| ~ q1(X1,X1,X1) ),
c_0_16 ).
cnf(c_0_25,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18])]) ).
cnf(c_0_26,plain,
( p3(X1,X1,X1)
| ~ n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_244]) ).
cnf(c_0_27,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
c_0_19 ).
cnf(c_0_28,plain,
p1(e,e,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_29,plain,
( k5(X1)
| ~ s4(X2)
| ~ r3(X3,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_300]) ).
cnf(c_0_30,plain,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
c_0_23 ).
cnf(c_0_31,plain,
p2(e,e,e),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
~ k5(e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_33,plain,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
inference(fof_simplification,[status(thm)],[rule_299]) ).
cnf(c_0_34,plain,
( p3(X1,X1,X1)
| ~ n2(X1) ),
c_0_26 ).
cnf(c_0_35,plain,
n2(e),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_37,plain,
( k5(X1)
| ~ s4(X2)
| ~ r3(X3,X1,X1) ),
c_0_29 ).
cnf(c_0_38,plain,
r3(e,e,e),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
~ k5(e),
c_0_32 ).
cnf(c_0_40,plain,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
c_0_33 ).
cnf(c_0_41,plain,
p3(e,e,e),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
c_0_36 ).
cnf(c_0_43,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_44,plain,
~ s4(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_45,plain,
( s4(X1)
| ~ l1(X1,e) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
l1(e,e),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
~ l1(X1,e),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
$false,
inference(sr,[status(thm)],[c_0_46,c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN117-1 : TPTP v8.2.0. Released v1.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 15:28:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/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.20/0.55 # Version: 3.1.0
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # sh5l with pid 2151 completed with status 0
% 0.20/0.55 # Result found by sh5l
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # SAT001_MinMin_p005000_rr_RG with pid 2164 completed with status 0
% 0.20/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # Preprocessing time : 0.005 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Unsatisfiable
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 369
% 0.20/0.55 # Removed by relevancy pruning/SinE : 0
% 0.20/0.55 # Initial clauses : 369
% 0.20/0.55 # Removed in clause preprocessing : 7
% 0.20/0.55 # Initial clauses in saturation : 362
% 0.20/0.55 # Processed clauses : 609
% 0.20/0.55 # ...of these trivial : 15
% 0.20/0.55 # ...subsumed : 23
% 0.20/0.55 # ...remaining for further processing : 571
% 0.20/0.55 # Other redundant clauses eliminated : 0
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 15
% 0.20/0.55 # Backward-rewritten : 29
% 0.20/0.55 # Generated clauses : 233
% 0.20/0.55 # ...of the previous two non-redundant : 151
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 2
% 0.20/0.55 # Paramodulations : 232
% 0.20/0.55 # Factorizations : 0
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 0
% 0.20/0.55 # Disequality decompositions : 0
% 0.20/0.55 # Total rewrite steps : 202
% 0.20/0.55 # ...of those cached : 122
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 198
% 0.20/0.55 # Positive orientable unit clauses : 95
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 3
% 0.20/0.55 # Non-unit-clauses : 100
% 0.20/0.55 # Current number of unprocessed clauses: 228
% 0.20/0.55 # ...number of literals in the above : 671
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 373
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 26906
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 18181
% 0.20/0.55 # Non-unit clause-clause subsumptions : 29
% 0.20/0.55 # Unit Clause-clause subsumption calls : 272
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 46
% 0.20/0.55 # BW rewrite match successes : 29
% 0.20/0.55 # Condensation attempts : 0
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 15014
% 0.20/0.55 # Search garbage collected termcells : 1461
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.044 s
% 0.20/0.55 # System time : 0.007 s
% 0.20/0.55 # Total time : 0.051 s
% 0.20/0.55 # Maximum resident set size: 2680 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.049 s
% 0.20/0.55 # System time : 0.010 s
% 0.20/0.55 # Total time : 0.059 s
% 0.20/0.55 # Maximum resident set size: 2020 pages
% 0.20/0.55 % E---3.1 exiting
% 0.46/0.55 % E exiting
%------------------------------------------------------------------------------