TSTP Solution File: SYN615-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN615-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:17:57 EDT 2023
% Result : Unsatisfiable 236.47s 30.57s
% Output : CNFRefutation 236.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 39 ( 17 unt; 0 nHn; 35 RR)
% Number of literals : 82 ( 0 equ; 48 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 8 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p2_17,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',p2_17) ).
cnf(p2_5,negated_conjecture,
p2(c26,f3(c22)),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',p2_5) ).
cnf(p7_16,negated_conjecture,
( p7(X1,X2)
| ~ p7(X3,X1)
| ~ p7(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',p7_16) ).
cnf(p7_2,negated_conjecture,
p7(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',p7_2) ).
cnf(p2_14,negated_conjecture,
p2(c26,f14(f16(c28,f17(c21,c27)),c25)),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',p2_14) ).
cnf(p7_23,negated_conjecture,
( p7(f8(X1,X2),f8(X3,X4))
| ~ p7(X1,X3)
| ~ p7(X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',p7_23) ).
cnf(p7_29,negated_conjecture,
p7(c25,f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),c26),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27))))),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',p7_29) ).
cnf(p2_3,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',p2_3) ).
cnf(not_p19_30,negated_conjecture,
( ~ p19(X1,f3(f4(f5(c22))))
| ~ p20(X2,f6(f3(f4(f5(c22))),c21))
| ~ p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22))
| ~ p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X1),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(X2),f10(f11(f3(f4(f5(c22)))),c27))))) ),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',not_p19_30) ).
cnf(p20_8,negated_conjecture,
p20(c24,f6(f3(f4(f5(c22))),c21)),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',p20_8) ).
cnf(p7_24,negated_conjecture,
( p7(f10(X1,X2),f10(X3,X4))
| ~ p2(X2,X4)
| ~ p7(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',p7_24) ).
cnf(p19_7,negated_conjecture,
p19(c23,f3(f4(f5(c22)))),
file('/export/starexec/sandbox2/tmp/tmp.dF3zX4o4FV/E---3.1_6841.p',p19_7) ).
cnf(c_0_12,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
p2_17 ).
cnf(c_0_13,negated_conjecture,
p2(c26,f3(c22)),
p2_5 ).
cnf(c_0_14,negated_conjecture,
( p7(X1,X2)
| ~ p7(X3,X1)
| ~ p7(X3,X2) ),
p7_16 ).
cnf(c_0_15,negated_conjecture,
p7(X1,X1),
p7_2 ).
cnf(c_0_16,negated_conjecture,
( p2(X1,f3(c22))
| ~ p2(c26,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
p2(c26,f14(f16(c28,f17(c21,c27)),c25)),
p2_14 ).
cnf(c_0_18,negated_conjecture,
( p7(f8(X1,X2),f8(X3,X4))
| ~ p7(X1,X3)
| ~ p7(X2,X4) ),
p7_23 ).
cnf(c_0_19,negated_conjecture,
( p7(X1,X2)
| ~ p7(X2,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
p7(c25,f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),c26),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27))))),
p7_29 ).
cnf(c_0_21,negated_conjecture,
( p2(X1,f3(c22))
| ~ p2(c26,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( p2(X1,f14(f16(c28,f17(c21,c27)),c25))
| ~ p2(c26,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
p2(X1,X1),
p2_3 ).
cnf(c_0_24,negated_conjecture,
( p7(X1,f8(X2,X3))
| ~ p7(f8(X4,X5),X1)
| ~ p7(X5,X3)
| ~ p7(X4,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
p7(f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),c26),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27)))),c25),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( p2(X1,f3(c22))
| ~ p2(f14(f16(c28,f17(c21,c27)),c25),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
( p7(c25,f8(X1,X2))
| ~ p7(f8(f10(f11(f3(f4(f5(c22)))),c26),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27))),X2)
| ~ p7(f10(f12(f11(f3(f5(c22)))),c23),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( ~ p19(X1,f3(f4(f5(c22))))
| ~ p20(X2,f6(f3(f4(f5(c22))),c21))
| ~ p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22))
| ~ p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X1),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(X2),f10(f11(f3(f4(f5(c22)))),c27))))) ),
not_p19_30 ).
cnf(c_0_29,negated_conjecture,
p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_17])]) ).
cnf(c_0_30,negated_conjecture,
( p7(c25,f8(X1,f8(X2,X3)))
| ~ p7(f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27)),X3)
| ~ p7(f10(f12(f11(f3(f5(c22)))),c23),X1)
| ~ p7(f10(f11(f3(f4(f5(c22)))),c26),X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_31,negated_conjecture,
( ~ p20(X1,f6(f3(f4(f5(c22))),c21))
| ~ p19(X2,f3(f4(f5(c22))))
| ~ p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X2),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(X1),f10(f11(f3(f4(f5(c22)))),c27))))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
( p7(c25,f8(X1,f8(X2,f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27)))))
| ~ p7(f10(f12(f11(f3(f5(c22)))),c23),X1)
| ~ p7(f10(f11(f3(f4(f5(c22)))),c26),X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_15]) ).
cnf(c_0_33,negated_conjecture,
p20(c24,f6(f3(f4(f5(c22))),c21)),
p20_8 ).
cnf(c_0_34,negated_conjecture,
( ~ p19(X1,f3(f4(f5(c22))))
| ~ p7(f10(f11(f3(f4(f5(c22)))),c26),f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)))
| ~ p7(f10(f12(f11(f3(f5(c22)))),c23),f10(f12(f11(f3(f5(c22)))),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_35,negated_conjecture,
( p7(f10(X1,X2),f10(X3,X4))
| ~ p2(X2,X4)
| ~ p7(X1,X3) ),
p7_24 ).
cnf(c_0_36,negated_conjecture,
( ~ p19(X1,f3(f4(f5(c22))))
| ~ p7(f10(f12(f11(f3(f5(c22)))),c23),f10(f12(f11(f3(f5(c22)))),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_17]),c_0_15])]) ).
cnf(c_0_37,negated_conjecture,
p19(c23,f3(f4(f5(c22)))),
p19_7 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_15]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN615-1 : TPTP v8.1.2. Released v2.5.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 18:09:10 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.dF3zX4o4FV/E---3.1_6841.p
% 236.47/30.57 # Version: 3.1pre001
% 236.47/30.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 236.47/30.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 236.47/30.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 236.47/30.57 # Starting new_bool_3 with 300s (1) cores
% 236.47/30.57 # Starting new_bool_1 with 300s (1) cores
% 236.47/30.57 # Starting sh5l with 300s (1) cores
% 236.47/30.57 # sh5l with pid 7000 completed with status 0
% 236.47/30.57 # Result found by sh5l
% 236.47/30.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 236.47/30.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 236.47/30.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 236.47/30.57 # Starting new_bool_3 with 300s (1) cores
% 236.47/30.57 # Starting new_bool_1 with 300s (1) cores
% 236.47/30.57 # Starting sh5l with 300s (1) cores
% 236.47/30.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 236.47/30.57 # Search class: FHHNM-FFMS21-DFFFFFNN
% 236.47/30.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 236.47/30.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 181s (1) cores
% 236.47/30.57 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 7008 completed with status 0
% 236.47/30.57 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 236.47/30.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 236.47/30.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 236.47/30.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 236.47/30.57 # Starting new_bool_3 with 300s (1) cores
% 236.47/30.57 # Starting new_bool_1 with 300s (1) cores
% 236.47/30.57 # Starting sh5l with 300s (1) cores
% 236.47/30.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 236.47/30.57 # Search class: FHHNM-FFMS21-DFFFFFNN
% 236.47/30.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 236.47/30.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 181s (1) cores
% 236.47/30.57 # Preprocessing time : 0.113 s
% 236.47/30.57
% 236.47/30.57 # Proof found!
% 236.47/30.57 # SZS status Unsatisfiable
% 236.47/30.57 # SZS output start CNFRefutation
% See solution above
% 236.47/30.57 # Parsed axioms : 31
% 236.47/30.57 # Removed by relevancy pruning/SinE : 0
% 236.47/30.57 # Initial clauses : 31
% 236.47/30.57 # Removed in clause preprocessing : 0
% 236.47/30.57 # Initial clauses in saturation : 31
% 236.47/30.57 # Processed clauses : 58581
% 236.47/30.57 # ...of these trivial : 201
% 236.47/30.57 # ...subsumed : 45500
% 236.47/30.57 # ...remaining for further processing : 12880
% 236.47/30.57 # Other redundant clauses eliminated : 0
% 236.47/30.57 # Clauses deleted for lack of memory : 0
% 236.47/30.57 # Backward-subsumed : 209
% 236.47/30.57 # Backward-rewritten : 1
% 236.47/30.57 # Generated clauses : 2044056
% 236.47/30.57 # ...of the previous two non-redundant : 1992173
% 236.47/30.57 # ...aggressively subsumed : 0
% 236.47/30.57 # Contextual simplify-reflections : 116
% 236.47/30.57 # Paramodulations : 2044056
% 236.47/30.57 # Factorizations : 0
% 236.47/30.57 # NegExts : 0
% 236.47/30.57 # Equation resolutions : 0
% 236.47/30.57 # Total rewrite steps : 352502
% 236.47/30.57 # Propositional unsat checks : 2
% 236.47/30.57 # Propositional check models : 1
% 236.47/30.57 # Propositional check unsatisfiable : 0
% 236.47/30.57 # Propositional clauses : 0
% 236.47/30.57 # Propositional clauses after purity: 0
% 236.47/30.57 # Propositional unsat core size : 0
% 236.47/30.57 # Propositional preprocessing time : 0.000
% 236.47/30.57 # Propositional encoding time : 1.162
% 236.47/30.57 # Propositional solver time : 0.098
% 236.47/30.57 # Success case prop preproc time : 0.000
% 236.47/30.57 # Success case prop encoding time : 0.000
% 236.47/30.57 # Success case prop solver time : 0.000
% 236.47/30.57 # Current number of processed clauses : 12670
% 236.47/30.57 # Positive orientable unit clauses : 65
% 236.47/30.57 # Positive unorientable unit clauses: 0
% 236.47/30.57 # Negative unit clauses : 2
% 236.47/30.57 # Non-unit-clauses : 12603
% 236.47/30.57 # Current number of unprocessed clauses: 1932723
% 236.47/30.57 # ...number of literals in the above : 9662608
% 236.47/30.57 # Current number of archived formulas : 0
% 236.47/30.57 # Current number of archived clauses : 210
% 236.47/30.57 # Clause-clause subsumption calls (NU) : 17072376
% 236.47/30.57 # Rec. Clause-clause subsumption calls : 7292612
% 236.47/30.57 # Non-unit clause-clause subsumptions : 45808
% 236.47/30.57 # Unit Clause-clause subsumption calls : 28068
% 236.47/30.57 # Rewrite failures with RHS unbound : 0
% 236.47/30.57 # BW rewrite match attempts : 150
% 236.47/30.57 # BW rewrite match successes : 4
% 236.47/30.57 # Condensation attempts : 0
% 236.47/30.57 # Condensation successes : 0
% 236.47/30.57 # Termbank termtop insertions : 50196600
% 236.47/30.57
% 236.47/30.57 # -------------------------------------------------
% 236.47/30.57 # User time : 28.379 s
% 236.47/30.57 # System time : 1.090 s
% 236.47/30.57 # Total time : 29.469 s
% 236.47/30.57 # Maximum resident set size: 1788 pages
% 236.47/30.57
% 236.47/30.57 # -------------------------------------------------
% 236.47/30.57 # User time : 28.380 s
% 236.47/30.57 # System time : 1.094 s
% 236.47/30.57 # Total time : 29.474 s
% 236.47/30.57 # Maximum resident set size: 1732 pages
% 236.47/30.57 % E---3.1 exiting
% 236.47/30.58 % E---3.1 exiting
%------------------------------------------------------------------------------