TSTP Solution File: SYN630-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN630-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 08:00:47 EDT 2024
% Result : Unsatisfiable 0.74s 0.56s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 15 unt; 0 nHn; 17 RR)
% Number of literals : 50 ( 0 equ; 29 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 8 con; 0-2 aty)
% Number of variables : 41 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p22_19,negated_conjecture,
( p22(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X4,X2)
| ~ p22(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22_19) ).
cnf(p4_34,negated_conjecture,
( p4(f5(f7(X1,f8(X2,X3)),X4),X5)
| ~ p21(X6,f9(f10(f11(c29))))
| ~ p21(X5,f12(f9(f10(f11(c29))),X2))
| ~ p22(f12(f9(f10(f11(c29))),f18(X2,f9(f11(c29)))),X5)
| ~ p3(X4,f13(f15(f17(f16(f9(f11(c29)))),X6),f13(f15(f16(f9(f10(f11(c29)))),X7),f14(f16(X5),f15(f16(f9(f10(f11(c29)))),X3))))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4_34) ).
cnf(p22_17,negated_conjecture,
p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),c27),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22_17) ).
cnf(p3_30,negated_conjecture,
p3(c26,f13(f15(f17(f16(f9(f11(c29)))),c28),f13(f15(f16(f9(f10(f11(c29)))),c30),f14(f16(c27),f15(f16(f9(f10(f11(c29)))),c25))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_30) ).
cnf(p21_5,negated_conjecture,
p21(c28,f9(f10(f11(c29)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_5) ).
cnf(p4_3,negated_conjecture,
p4(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4_3) ).
cnf(not_p4_12,negated_conjecture,
~ p4(f5(f7(c23,f8(c24,c25)),c26),c27),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p4_12) ).
cnf(p21_6,negated_conjecture,
p21(c27,f12(f9(f10(f11(c29))),c24)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_6) ).
cnf(c_0_8,negated_conjecture,
( p22(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X4,X2)
| ~ p22(X3,X4) ),
inference(fof_simplification,[status(thm)],[p22_19]) ).
cnf(c_0_9,negated_conjecture,
( p4(f5(f7(X1,f8(X2,X3)),X4),X5)
| ~ p21(X6,f9(f10(f11(c29))))
| ~ p21(X5,f12(f9(f10(f11(c29))),X2))
| ~ p22(f12(f9(f10(f11(c29))),f18(X2,f9(f11(c29)))),X5)
| ~ p3(X4,f13(f15(f17(f16(f9(f11(c29)))),X6),f13(f15(f16(f9(f10(f11(c29)))),X7),f14(f16(X5),f15(f16(f9(f10(f11(c29)))),X3))))) ),
inference(fof_simplification,[status(thm)],[p4_34]) ).
cnf(c_0_10,negated_conjecture,
( p22(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X4,X2)
| ~ p22(X3,X4) ),
c_0_8 ).
cnf(c_0_11,negated_conjecture,
p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),c27),
p22_17 ).
cnf(c_0_12,negated_conjecture,
( p4(f5(f7(X1,f8(X2,X3)),X4),X5)
| ~ p21(X6,f9(f10(f11(c29))))
| ~ p21(X5,f12(f9(f10(f11(c29))),X2))
| ~ p22(f12(f9(f10(f11(c29))),f18(X2,f9(f11(c29)))),X5)
| ~ p3(X4,f13(f15(f17(f16(f9(f11(c29)))),X6),f13(f15(f16(f9(f10(f11(c29)))),X7),f14(f16(X5),f15(f16(f9(f10(f11(c29)))),X3))))) ),
c_0_9 ).
cnf(c_0_13,negated_conjecture,
p3(c26,f13(f15(f17(f16(f9(f11(c29)))),c28),f13(f15(f16(f9(f10(f11(c29)))),c30),f14(f16(c27),f15(f16(f9(f10(f11(c29)))),c25))))),
p3_30 ).
cnf(c_0_14,negated_conjecture,
p21(c28,f9(f10(f11(c29)))),
p21_5 ).
cnf(c_0_15,negated_conjecture,
( p22(X1,X2)
| ~ p4(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),X1)
| ~ p4(c27,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
p4(X1,X1),
p4_3 ).
cnf(c_0_17,negated_conjecture,
~ p4(f5(f7(c23,f8(c24,c25)),c26),c27),
inference(fof_simplification,[status(thm)],[not_p4_12]) ).
cnf(c_0_18,negated_conjecture,
( p4(f5(f7(X1,f8(X2,c25)),c26),c27)
| ~ p22(f12(f9(f10(f11(c29))),f18(X2,f9(f11(c29)))),c27)
| ~ p21(c27,f12(f9(f10(f11(c29))),X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_19,negated_conjecture,
( p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),X1)
| ~ p4(c27,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
p21(c27,f12(f9(f10(f11(c29))),c24)),
p21_6 ).
cnf(c_0_21,negated_conjecture,
~ p4(f5(f7(c23,f8(c24,c25)),c26),c27),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
p4(f5(f7(X1,f8(c24,c25)),c26),c27),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_16])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN630-1 : TPTP v8.2.0. Released v2.5.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n026.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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 15:30:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.74/0.56 # Version: 3.1.0
% 0.74/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.74/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.74/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.74/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.74/0.56 # Starting sh5l with 300s (1) cores
% 0.74/0.56 # new_bool_3 with pid 21669 completed with status 0
% 0.74/0.56 # Result found by new_bool_3
% 0.74/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.74/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.74/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.74/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.74/0.56 # Search class: FGUNM-FFMS21-DFFFFFNN
% 0.74/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.74/0.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.74/0.56 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 21675 completed with status 0
% 0.74/0.56 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.74/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.74/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.74/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.74/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.74/0.56 # Search class: FGUNM-FFMS21-DFFFFFNN
% 0.74/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.74/0.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.74/0.56 # Preprocessing time : 0.002 s
% 0.74/0.56 # Presaturation interreduction done
% 0.74/0.56
% 0.74/0.56 # Proof found!
% 0.74/0.56 # SZS status Unsatisfiable
% 0.74/0.56 # SZS output start CNFRefutation
% See solution above
% 0.74/0.56 # Parsed axioms : 36
% 0.74/0.56 # Removed by relevancy pruning/SinE : 0
% 0.74/0.56 # Initial clauses : 36
% 0.74/0.56 # Removed in clause preprocessing : 0
% 0.74/0.56 # Initial clauses in saturation : 36
% 0.74/0.56 # Processed clauses : 469
% 0.74/0.56 # ...of these trivial : 1
% 0.74/0.56 # ...subsumed : 171
% 0.74/0.56 # ...remaining for further processing : 297
% 0.74/0.56 # Other redundant clauses eliminated : 0
% 0.74/0.56 # Clauses deleted for lack of memory : 0
% 0.74/0.56 # Backward-subsumed : 2
% 0.74/0.56 # Backward-rewritten : 1
% 0.74/0.56 # Generated clauses : 2055
% 0.74/0.56 # ...of the previous two non-redundant : 1993
% 0.74/0.56 # ...aggressively subsumed : 0
% 0.74/0.56 # Contextual simplify-reflections : 0
% 0.74/0.56 # Paramodulations : 2055
% 0.74/0.56 # Factorizations : 0
% 0.74/0.56 # NegExts : 0
% 0.74/0.56 # Equation resolutions : 0
% 0.74/0.56 # Disequality decompositions : 0
% 0.74/0.56 # Total rewrite steps : 63
% 0.74/0.56 # ...of those cached : 45
% 0.74/0.56 # Propositional unsat checks : 0
% 0.74/0.56 # Propositional check models : 0
% 0.74/0.56 # Propositional check unsatisfiable : 0
% 0.74/0.56 # Propositional clauses : 0
% 0.74/0.56 # Propositional clauses after purity: 0
% 0.74/0.56 # Propositional unsat core size : 0
% 0.74/0.56 # Propositional preprocessing time : 0.000
% 0.74/0.56 # Propositional encoding time : 0.000
% 0.74/0.56 # Propositional solver time : 0.000
% 0.74/0.56 # Success case prop preproc time : 0.000
% 0.74/0.56 # Success case prop encoding time : 0.000
% 0.74/0.56 # Success case prop solver time : 0.000
% 0.74/0.56 # Current number of processed clauses : 258
% 0.74/0.56 # Positive orientable unit clauses : 14
% 0.74/0.56 # Positive unorientable unit clauses: 0
% 0.74/0.56 # Negative unit clauses : 1
% 0.74/0.56 # Non-unit-clauses : 243
% 0.74/0.56 # Current number of unprocessed clauses: 1596
% 0.74/0.56 # ...number of literals in the above : 5336
% 0.74/0.56 # Current number of archived formulas : 0
% 0.74/0.56 # Current number of archived clauses : 39
% 0.74/0.56 # Clause-clause subsumption calls (NU) : 8986
% 0.74/0.56 # Rec. Clause-clause subsumption calls : 6326
% 0.74/0.56 # Non-unit clause-clause subsumptions : 170
% 0.74/0.56 # Unit Clause-clause subsumption calls : 28
% 0.74/0.56 # Rewrite failures with RHS unbound : 0
% 0.74/0.56 # BW rewrite match attempts : 7
% 0.74/0.56 # BW rewrite match successes : 1
% 0.74/0.56 # Condensation attempts : 0
% 0.74/0.56 # Condensation successes : 0
% 0.74/0.56 # Termbank termtop insertions : 38281
% 0.74/0.56 # Search garbage collected termcells : 135
% 0.74/0.56
% 0.74/0.56 # -------------------------------------------------
% 0.74/0.56 # User time : 0.047 s
% 0.74/0.56 # System time : 0.004 s
% 0.74/0.56 # Total time : 0.050 s
% 0.74/0.56 # Maximum resident set size: 1868 pages
% 0.74/0.56
% 0.74/0.56 # -------------------------------------------------
% 0.74/0.56 # User time : 0.049 s
% 0.74/0.56 # System time : 0.006 s
% 0.74/0.56 # Total time : 0.055 s
% 0.74/0.56 # Maximum resident set size: 1744 pages
% 0.74/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------