TSTP Solution File: SYN644-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN644-1 : TPTP v8.2.0. Released v2.5.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:47:11 EDT 2024
% Result : Unsatisfiable 9.91s 1.72s
% Output : CNFRefutation 9.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 15 unt; 8 nHn; 27 RR)
% Number of literals : 101 ( 0 equ; 56 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-5 aty)
% Number of variables : 91 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p12_17,negated_conjecture,
( p12(X1,X2)
| ~ p12(X3,X1)
| ~ p12(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_17) ).
cnf(p12_39,negated_conjecture,
( p12(X1,f16(f10(X2,f11(X3,X4)),c32,X5))
| p23(f21(X2,X3,X4,X5,X1),f8(f10(X2,f11(X3,X4))))
| ~ p22(f3(f4(f5(c26))),X3)
| ~ p24(f17(f10(X2,f11(X3,X4)),X1))
| ~ p23(X1,f8(f10(X2,f11(X3,X4)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_39) ).
cnf(p12_1,negated_conjecture,
p12(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_1) ).
cnf(p25_37,negated_conjecture,
( p25(f13(f14(X1,f16(f10(X2,f11(X3,X4)),c32,X1))),f13(f14(X1,X5)))
| ~ p22(f3(f4(f5(c26))),X3)
| ~ p23(X5,f8(f10(X2,f11(X3,X4)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p25_37) ).
cnf(p22_7,negated_conjecture,
p22(f3(f4(f5(c26))),c27),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p22_7) ).
cnf(p25_25,negated_conjecture,
( p25(X1,X2)
| ~ p12(X3,X2)
| ~ p25(X4,X3)
| ~ p12(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p25_25) ).
cnf(p12_33,negated_conjecture,
p12(f13(f14(c31,c28)),f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_33) ).
cnf(f17_is_p24_9,negated_conjecture,
p24(f17(f10(c29,f11(c27,c30)),c28)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f17_is_p24_9) ).
cnf(p23_10,negated_conjecture,
p23(c28,f8(f10(c29,f11(c27,c30)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p23_10) ).
cnf(p12_40,negated_conjecture,
( p12(X1,f16(f10(X2,f11(X3,X4)),c32,X5))
| ~ p22(f3(f4(f5(c26))),X3)
| ~ p24(f17(f10(X2,f11(X3,X4)),X1))
| ~ p23(X1,f8(f10(X2,f11(X3,X4))))
| ~ p25(f13(f14(X5,X1)),f13(f14(X5,f21(X2,X3,X4,X5,X1)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_40) ).
cnf(not_p12_23,negated_conjecture,
~ p12(c28,f16(f10(c29,f11(c27,c30)),c32,c31)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p12_23) ).
cnf(c_0_11,negated_conjecture,
( p12(X1,X2)
| ~ p12(X3,X1)
| ~ p12(X3,X2) ),
inference(fof_simplification,[status(thm)],[p12_17]) ).
cnf(c_0_12,negated_conjecture,
( p12(X1,f16(f10(X2,f11(X3,X4)),c32,X5))
| p23(f21(X2,X3,X4,X5,X1),f8(f10(X2,f11(X3,X4))))
| ~ p22(f3(f4(f5(c26))),X3)
| ~ p24(f17(f10(X2,f11(X3,X4)),X1))
| ~ p23(X1,f8(f10(X2,f11(X3,X4)))) ),
inference(fof_simplification,[status(thm)],[p12_39]) ).
cnf(c_0_13,negated_conjecture,
( p12(X1,X2)
| ~ p12(X3,X1)
| ~ p12(X3,X2) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
p12(X1,X1),
p12_1 ).
cnf(c_0_15,negated_conjecture,
( p25(f13(f14(X1,f16(f10(X2,f11(X3,X4)),c32,X1))),f13(f14(X1,X5)))
| ~ p22(f3(f4(f5(c26))),X3)
| ~ p23(X5,f8(f10(X2,f11(X3,X4)))) ),
inference(fof_simplification,[status(thm)],[p25_37]) ).
cnf(c_0_16,negated_conjecture,
( p12(X1,f16(f10(X2,f11(X3,X4)),c32,X5))
| p23(f21(X2,X3,X4,X5,X1),f8(f10(X2,f11(X3,X4))))
| ~ p22(f3(f4(f5(c26))),X3)
| ~ p24(f17(f10(X2,f11(X3,X4)),X1))
| ~ p23(X1,f8(f10(X2,f11(X3,X4)))) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
p22(f3(f4(f5(c26))),c27),
p22_7 ).
cnf(c_0_18,negated_conjecture,
( p25(X1,X2)
| ~ p12(X3,X2)
| ~ p25(X4,X3)
| ~ p12(X4,X1) ),
inference(fof_simplification,[status(thm)],[p25_25]) ).
cnf(c_0_19,negated_conjecture,
( p12(X1,X2)
| ~ p12(X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
p12(f13(f14(c31,c28)),f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31)))),
p12_33 ).
cnf(c_0_21,negated_conjecture,
( p25(f13(f14(X1,f16(f10(X2,f11(X3,X4)),c32,X1))),f13(f14(X1,X5)))
| ~ p22(f3(f4(f5(c26))),X3)
| ~ p23(X5,f8(f10(X2,f11(X3,X4)))) ),
c_0_15 ).
cnf(c_0_22,negated_conjecture,
( p23(f21(X1,c27,X2,X3,X4),f8(f10(X1,f11(c27,X2))))
| p12(X4,f16(f10(X1,f11(c27,X2)),c32,X3))
| ~ p23(X4,f8(f10(X1,f11(c27,X2))))
| ~ p24(f17(f10(X1,f11(c27,X2)),X4)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
p24(f17(f10(c29,f11(c27,c30)),c28)),
f17_is_p24_9 ).
cnf(c_0_24,negated_conjecture,
p23(c28,f8(f10(c29,f11(c27,c30)))),
p23_10 ).
cnf(c_0_25,negated_conjecture,
( p12(X1,f16(f10(X2,f11(X3,X4)),c32,X5))
| ~ p22(f3(f4(f5(c26))),X3)
| ~ p24(f17(f10(X2,f11(X3,X4)),X1))
| ~ p23(X1,f8(f10(X2,f11(X3,X4))))
| ~ p25(f13(f14(X5,X1)),f13(f14(X5,f21(X2,X3,X4,X5,X1)))) ),
inference(fof_simplification,[status(thm)],[p12_40]) ).
cnf(c_0_26,negated_conjecture,
( p25(X1,X2)
| ~ p12(X3,X2)
| ~ p25(X4,X3)
| ~ p12(X4,X1) ),
c_0_18 ).
cnf(c_0_27,negated_conjecture,
p12(f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31))),f13(f14(c31,c28))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( p25(f13(f14(X1,f16(f10(X2,f11(c27,X3)),c32,X1))),f13(f14(X1,X4)))
| ~ p23(X4,f8(f10(X2,f11(c27,X3)))) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_29,negated_conjecture,
( p23(f21(c29,c27,c30,X1,c28),f8(f10(c29,f11(c27,c30))))
| p12(c28,f16(f10(c29,f11(c27,c30)),c32,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_30,negated_conjecture,
( p12(X1,f16(f10(X2,f11(X3,X4)),c32,X5))
| ~ p22(f3(f4(f5(c26))),X3)
| ~ p24(f17(f10(X2,f11(X3,X4)),X1))
| ~ p23(X1,f8(f10(X2,f11(X3,X4))))
| ~ p25(f13(f14(X5,X1)),f13(f14(X5,f21(X2,X3,X4,X5,X1)))) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
( p25(f13(f14(c31,c28)),X1)
| ~ p25(f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31))),X2)
| ~ p12(X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( p25(f13(f14(X1,f16(f10(c29,f11(c27,c30)),c32,X1))),f13(f14(X1,f21(c29,c27,c30,X2,c28))))
| p12(c28,f16(f10(c29,f11(c27,c30)),c32,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( p12(X1,f16(f10(X2,f11(c27,X3)),c32,X4))
| ~ p25(f13(f14(X4,X1)),f13(f14(X4,f21(X2,c27,X3,X4,X1))))
| ~ p23(X1,f8(f10(X2,f11(c27,X3))))
| ~ p24(f17(f10(X2,f11(c27,X3)),X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_34,negated_conjecture,
( p25(f13(f14(c31,c28)),X1)
| p12(c28,f16(f10(c29,f11(c27,c30)),c32,X2))
| ~ p12(f13(f14(c31,f21(c29,c27,c30,X2,c28))),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
~ p12(c28,f16(f10(c29,f11(c27,c30)),c32,c31)),
inference(fof_simplification,[status(thm)],[not_p12_23]) ).
cnf(c_0_36,negated_conjecture,
( p12(c28,f16(f10(c29,f11(c27,c30)),c32,X1))
| ~ p25(f13(f14(X1,c28)),f13(f14(X1,f21(c29,c27,c30,X1,c28)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_24]),c_0_23])]) ).
cnf(c_0_37,negated_conjecture,
( p25(f13(f14(c31,c28)),f13(f14(c31,f21(c29,c27,c30,X1,c28))))
| p12(c28,f16(f10(c29,f11(c27,c30)),c32,X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_14]) ).
cnf(c_0_38,negated_conjecture,
~ p12(c28,f16(f10(c29,f11(c27,c30)),c32,c31)),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN644-1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n019.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 14:07:38 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
% 9.91/1.72 # Version: 3.1.0
% 9.91/1.72 # Preprocessing class: FSLSSMSSSSSNFFN.
% 9.91/1.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.91/1.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.91/1.72 # Starting new_bool_3 with 300s (1) cores
% 9.91/1.72 # Starting new_bool_1 with 300s (1) cores
% 9.91/1.72 # Starting sh5l with 300s (1) cores
% 9.91/1.72 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 8404 completed with status 0
% 9.91/1.72 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 9.91/1.72 # Preprocessing class: FSLSSMSSSSSNFFN.
% 9.91/1.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.91/1.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.91/1.72 # No SInE strategy applied
% 9.91/1.72 # Search class: FGUNM-FFMS31-MFFFFFNN
% 9.91/1.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 9.91/1.72 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 811s (1) cores
% 9.91/1.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 9.91/1.72 # Starting new_bool_3 with 136s (1) cores
% 9.91/1.72 # Starting new_bool_1 with 136s (1) cores
% 9.91/1.72 # Starting sh5l with 136s (1) cores
% 9.91/1.72 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 8409 completed with status 0
% 9.91/1.72 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 9.91/1.72 # Preprocessing class: FSLSSMSSSSSNFFN.
% 9.91/1.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.91/1.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 9.91/1.72 # No SInE strategy applied
% 9.91/1.72 # Search class: FGUNM-FFMS31-MFFFFFNN
% 9.91/1.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 9.91/1.72 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 811s (1) cores
% 9.91/1.72 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 9.91/1.72 # Preprocessing time : 0.002 s
% 9.91/1.72 # Presaturation interreduction done
% 9.91/1.72
% 9.91/1.72 # Proof found!
% 9.91/1.72 # SZS status Unsatisfiable
% 9.91/1.72 # SZS output start CNFRefutation
% See solution above
% 9.91/1.72 # Parsed axioms : 42
% 9.91/1.72 # Removed by relevancy pruning/SinE : 0
% 9.91/1.72 # Initial clauses : 42
% 9.91/1.72 # Removed in clause preprocessing : 0
% 9.91/1.72 # Initial clauses in saturation : 42
% 9.91/1.72 # Processed clauses : 2575
% 9.91/1.72 # ...of these trivial : 282
% 9.91/1.72 # ...subsumed : 5
% 9.91/1.72 # ...remaining for further processing : 2288
% 9.91/1.72 # Other redundant clauses eliminated : 0
% 9.91/1.72 # Clauses deleted for lack of memory : 0
% 9.91/1.72 # Backward-subsumed : 47
% 9.91/1.72 # Backward-rewritten : 19
% 9.91/1.72 # Generated clauses : 109108
% 9.91/1.72 # ...of the previous two non-redundant : 107484
% 9.91/1.72 # ...aggressively subsumed : 0
% 9.91/1.72 # Contextual simplify-reflections : 0
% 9.91/1.72 # Paramodulations : 109108
% 9.91/1.72 # Factorizations : 0
% 9.91/1.72 # NegExts : 0
% 9.91/1.72 # Equation resolutions : 0
% 9.91/1.72 # Disequality decompositions : 0
% 9.91/1.72 # Total rewrite steps : 1922
% 9.91/1.72 # ...of those cached : 730
% 9.91/1.72 # Propositional unsat checks : 0
% 9.91/1.72 # Propositional check models : 0
% 9.91/1.72 # Propositional check unsatisfiable : 0
% 9.91/1.72 # Propositional clauses : 0
% 9.91/1.72 # Propositional clauses after purity: 0
% 9.91/1.72 # Propositional unsat core size : 0
% 9.91/1.72 # Propositional preprocessing time : 0.000
% 9.91/1.72 # Propositional encoding time : 0.000
% 9.91/1.72 # Propositional solver time : 0.000
% 9.91/1.72 # Success case prop preproc time : 0.000
% 9.91/1.72 # Success case prop encoding time : 0.000
% 9.91/1.72 # Success case prop solver time : 0.000
% 9.91/1.72 # Current number of processed clauses : 2180
% 9.91/1.72 # Positive orientable unit clauses : 520
% 9.91/1.72 # Positive unorientable unit clauses: 0
% 9.91/1.72 # Negative unit clauses : 1
% 9.91/1.72 # Non-unit-clauses : 1659
% 9.91/1.72 # Current number of unprocessed clauses: 104957
% 9.91/1.72 # ...number of literals in the above : 107816
% 9.91/1.72 # Current number of archived formulas : 0
% 9.91/1.72 # Current number of archived clauses : 108
% 9.91/1.72 # Clause-clause subsumption calls (NU) : 158896
% 9.91/1.72 # Rec. Clause-clause subsumption calls : 152109
% 9.91/1.72 # Non-unit clause-clause subsumptions : 52
% 9.91/1.72 # Unit Clause-clause subsumption calls : 9894
% 9.91/1.72 # Rewrite failures with RHS unbound : 0
% 9.91/1.72 # BW rewrite match attempts : 12861
% 9.91/1.72 # BW rewrite match successes : 19
% 9.91/1.72 # Condensation attempts : 0
% 9.91/1.72 # Condensation successes : 0
% 9.91/1.72 # Termbank termtop insertions : 6023783
% 9.91/1.72 # Search garbage collected termcells : 150
% 9.91/1.72
% 9.91/1.72 # -------------------------------------------------
% 9.91/1.72 # User time : 1.126 s
% 9.91/1.72 # System time : 0.081 s
% 9.91/1.72 # Total time : 1.207 s
% 9.91/1.72 # Maximum resident set size: 1728 pages
% 9.91/1.72
% 9.91/1.72 # -------------------------------------------------
% 9.91/1.72 # User time : 5.948 s
% 9.91/1.72 # System time : 0.126 s
% 9.91/1.72 # Total time : 6.074 s
% 9.91/1.72 # Maximum resident set size: 1744 pages
% 9.91/1.72 % E---3.1 exiting
% 9.91/1.72 % E exiting
%------------------------------------------------------------------------------