TSTP Solution File: SYN655-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN655-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:52 EDT 2024
% Result : Unsatisfiable 5.01s 1.11s
% Output : CNFRefutation 5.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 9 unt; 0 nHn; 16 RR)
% Number of literals : 49 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 12 con; 0-8 aty)
% Number of variables : 152 ( 47 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p9_17,negated_conjecture,
( p9(X1,X2)
| ~ p9(X3,X1)
| ~ p9(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_17) ).
cnf(p9_2,negated_conjecture,
p9(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_2) ).
cnf(p9_35,negated_conjecture,
( p9(X1,f15(X2,X3,X4,X5,X6,X7,X8,X1))
| ~ p21(f11(X3,X4,X7,X8,X1,X5),X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_35) ).
cnf(p9_30,negated_conjecture,
( p9(X1,X2)
| ~ p3(f11(X3,X4,X5,X6,X1,X7),f11(X8,X9,X10,X11,X2,X12)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_30) ).
cnf(p3_48,negated_conjecture,
( p3(X1,f11(f19(X2,X3,X4,X5,X1,X6,X7,X8),f18(X2,X3,X4,X5,X1,X6,X7,X8),f17(X2,X3,X4,X5,X1,X6,X7,X8),f16(X2,X3,X4,X5,X1,X6,X7,X8),f15(X2,X3,X4,X5,X1,X6,X7,X8),f14(X2,X3,X4,X5,X1,X6,X7,X8)))
| ~ p21(f11(X3,X4,X6,X7,X8,X5),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_48) ).
cnf(p21_27,negated_conjecture,
p21(f11(c24,c25,c26,c27,c22,c28),f11(c29,c30,c31,c32,c23,c33)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_27) ).
cnf(not_p9_10,negated_conjecture,
~ p9(c22,c23),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p9_10) ).
cnf(c_0_7,negated_conjecture,
( p9(X1,X2)
| ~ p9(X3,X1)
| ~ p9(X3,X2) ),
inference(fof_simplification,[status(thm)],[p9_17]) ).
cnf(c_0_8,negated_conjecture,
( p9(X1,X2)
| ~ p9(X3,X1)
| ~ p9(X3,X2) ),
c_0_7 ).
cnf(c_0_9,negated_conjecture,
p9(X1,X1),
p9_2 ).
cnf(c_0_10,negated_conjecture,
( p9(X1,f15(X2,X3,X4,X5,X6,X7,X8,X1))
| ~ p21(f11(X3,X4,X7,X8,X1,X5),X6) ),
inference(fof_simplification,[status(thm)],[p9_35]) ).
cnf(c_0_11,negated_conjecture,
( p9(X1,X2)
| ~ p3(f11(X3,X4,X5,X6,X1,X7),f11(X8,X9,X10,X11,X2,X12)) ),
inference(fof_simplification,[status(thm)],[p9_30]) ).
cnf(c_0_12,negated_conjecture,
( p3(X1,f11(f19(X2,X3,X4,X5,X1,X6,X7,X8),f18(X2,X3,X4,X5,X1,X6,X7,X8),f17(X2,X3,X4,X5,X1,X6,X7,X8),f16(X2,X3,X4,X5,X1,X6,X7,X8),f15(X2,X3,X4,X5,X1,X6,X7,X8),f14(X2,X3,X4,X5,X1,X6,X7,X8)))
| ~ p21(f11(X3,X4,X6,X7,X8,X5),X1) ),
inference(fof_simplification,[status(thm)],[p3_48]) ).
cnf(c_0_13,negated_conjecture,
( p9(X1,X2)
| ~ p9(X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( p9(X1,f15(X2,X3,X4,X5,X6,X7,X8,X1))
| ~ p21(f11(X3,X4,X7,X8,X1,X5),X6) ),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
( p9(X1,X2)
| ~ p3(f11(X3,X4,X5,X6,X1,X7),f11(X8,X9,X10,X11,X2,X12)) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
( p3(X1,f11(f19(X2,X3,X4,X5,X1,X6,X7,X8),f18(X2,X3,X4,X5,X1,X6,X7,X8),f17(X2,X3,X4,X5,X1,X6,X7,X8),f16(X2,X3,X4,X5,X1,X6,X7,X8),f15(X2,X3,X4,X5,X1,X6,X7,X8),f14(X2,X3,X4,X5,X1,X6,X7,X8)))
| ~ p21(f11(X3,X4,X6,X7,X8,X5),X1) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
( p9(f15(X1,X2,X3,X4,X5,X6,X7,X8),X8)
| ~ p21(f11(X2,X3,X6,X7,X8,X4),X5) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( p9(X1,f15(X2,X3,X4,X5,f11(X6,X7,X8,X9,X1,X10),X11,X12,X13))
| ~ p21(f11(X3,X4,X11,X12,X13,X5),f11(X6,X7,X8,X9,X1,X10)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( p9(X1,X2)
| ~ p21(f11(X3,X4,X5,X6,X2,X7),X8)
| ~ p9(f15(X9,X3,X4,X7,X8,X5,X6,X2),X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( p9(f15(X1,X2,X3,X4,f11(X5,X6,X7,X8,X9,X10),X11,X12,X13),X9)
| ~ p21(f11(X2,X3,X11,X12,X13,X4),f11(X5,X6,X7,X8,X9,X10)) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( p9(X1,X2)
| ~ p21(f11(X3,X4,X5,X6,X2,X7),f11(X8,X9,X10,X11,X1,X12)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
p21(f11(c24,c25,c26,c27,c22,c28),f11(c29,c30,c31,c32,c23,c33)),
p21_27 ).
cnf(c_0_23,negated_conjecture,
~ p9(c22,c23),
inference(fof_simplification,[status(thm)],[not_p9_10]) ).
cnf(c_0_24,negated_conjecture,
p9(c23,c22),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
~ p9(c22,c23),
c_0_23 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN655-1 : TPTP v8.2.0. Released v2.5.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n022.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 14:46:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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
% 5.01/1.11 # Version: 3.1.0
% 5.01/1.11 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.01/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.01/1.11 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.01/1.11 # Starting new_bool_3 with 300s (1) cores
% 5.01/1.11 # Starting new_bool_1 with 300s (1) cores
% 5.01/1.11 # Starting sh5l with 300s (1) cores
% 5.01/1.11 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 23064 completed with status 0
% 5.01/1.11 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 5.01/1.11 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.01/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.01/1.11 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.01/1.11 # No SInE strategy applied
% 5.01/1.11 # Search class: FHUNM-FFMF33-SFFFFFNN
% 5.01/1.11 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.01/1.11 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 5.01/1.11 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.01/1.11 # Starting new_bool_3 with 136s (1) cores
% 5.01/1.11 # Starting new_bool_1 with 136s (1) cores
% 5.01/1.11 # Starting sh5l with 136s (1) cores
% 5.01/1.11 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 23071 completed with status 0
% 5.01/1.11 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 5.01/1.11 # Preprocessing class: FSLSSMSMSSSNFFN.
% 5.01/1.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.01/1.11 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.01/1.11 # No SInE strategy applied
% 5.01/1.11 # Search class: FHUNM-FFMF33-SFFFFFNN
% 5.01/1.11 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.01/1.11 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 5.01/1.11 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.01/1.11 # Preprocessing time : 0.002 s
% 5.01/1.11 # Presaturation interreduction done
% 5.01/1.11
% 5.01/1.11 # Proof found!
% 5.01/1.11 # SZS status Unsatisfiable
% 5.01/1.11 # SZS output start CNFRefutation
% See solution above
% 5.01/1.11 # Parsed axioms : 48
% 5.01/1.11 # Removed by relevancy pruning/SinE : 0
% 5.01/1.11 # Initial clauses : 48
% 5.01/1.11 # Removed in clause preprocessing : 0
% 5.01/1.11 # Initial clauses in saturation : 48
% 5.01/1.11 # Processed clauses : 6950
% 5.01/1.11 # ...of these trivial : 11
% 5.01/1.11 # ...subsumed : 5749
% 5.01/1.11 # ...remaining for further processing : 1190
% 5.01/1.11 # Other redundant clauses eliminated : 0
% 5.01/1.11 # Clauses deleted for lack of memory : 0
% 5.01/1.11 # Backward-subsumed : 98
% 5.01/1.11 # Backward-rewritten : 0
% 5.01/1.11 # Generated clauses : 20518
% 5.01/1.11 # ...of the previous two non-redundant : 19856
% 5.01/1.11 # ...aggressively subsumed : 0
% 5.01/1.11 # Contextual simplify-reflections : 36
% 5.01/1.11 # Paramodulations : 20518
% 5.01/1.11 # Factorizations : 0
% 5.01/1.11 # NegExts : 0
% 5.01/1.11 # Equation resolutions : 0
% 5.01/1.11 # Disequality decompositions : 0
% 5.01/1.11 # Total rewrite steps : 2152
% 5.01/1.11 # ...of those cached : 1969
% 5.01/1.11 # Propositional unsat checks : 0
% 5.01/1.11 # Propositional check models : 0
% 5.01/1.11 # Propositional check unsatisfiable : 0
% 5.01/1.11 # Propositional clauses : 0
% 5.01/1.11 # Propositional clauses after purity: 0
% 5.01/1.11 # Propositional unsat core size : 0
% 5.01/1.11 # Propositional preprocessing time : 0.000
% 5.01/1.11 # Propositional encoding time : 0.000
% 5.01/1.11 # Propositional solver time : 0.000
% 5.01/1.11 # Success case prop preproc time : 0.000
% 5.01/1.11 # Success case prop encoding time : 0.000
% 5.01/1.11 # Success case prop solver time : 0.000
% 5.01/1.11 # Current number of processed clauses : 1046
% 5.01/1.11 # Positive orientable unit clauses : 22
% 5.01/1.11 # Positive unorientable unit clauses: 0
% 5.01/1.11 # Negative unit clauses : 5
% 5.01/1.11 # Non-unit-clauses : 1019
% 5.01/1.11 # Current number of unprocessed clauses: 12686
% 5.01/1.11 # ...number of literals in the above : 73026
% 5.01/1.11 # Current number of archived formulas : 0
% 5.01/1.11 # Current number of archived clauses : 144
% 5.01/1.11 # Clause-clause subsumption calls (NU) : 520614
% 5.01/1.11 # Rec. Clause-clause subsumption calls : 197177
% 5.01/1.11 # Non-unit clause-clause subsumptions : 5596
% 5.01/1.11 # Unit Clause-clause subsumption calls : 161
% 5.01/1.11 # Rewrite failures with RHS unbound : 0
% 5.01/1.11 # BW rewrite match attempts : 63
% 5.01/1.11 # BW rewrite match successes : 0
% 5.01/1.11 # Condensation attempts : 0
% 5.01/1.11 # Condensation successes : 0
% 5.01/1.11 # Termbank termtop insertions : 354701
% 5.01/1.11 # Search garbage collected termcells : 209
% 5.01/1.11
% 5.01/1.11 # -------------------------------------------------
% 5.01/1.11 # User time : 0.603 s
% 5.01/1.11 # System time : 0.012 s
% 5.01/1.11 # Total time : 0.615 s
% 5.01/1.11 # Maximum resident set size: 1756 pages
% 5.01/1.11
% 5.01/1.11 # -------------------------------------------------
% 5.01/1.11 # User time : 3.050 s
% 5.01/1.11 # System time : 0.016 s
% 5.01/1.11 # Total time : 3.066 s
% 5.01/1.11 # Maximum resident set size: 1764 pages
% 5.01/1.11 % E---3.1 exiting
%------------------------------------------------------------------------------