TSTP Solution File: SYN523-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN523-1 : TPTP v8.2.0. Released v2.1.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 07:59:57 EDT 2024
% Result : Satisfiable 0.17s 0.47s
% Output : Saturation 0.17s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_79)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_69,negated_conjecture,
ndr1_0,
inference(spm,[status(thm)],[c_0_54,c_0_55]),
[final] ).
cnf(c_0_90,negated_conjecture,
( ~ c3_1(a148)
| ~ c5_0
| ~ c1_0 ),
c_0_67,
[final] ).
cnf(c_0_91,negated_conjecture,
( ndr1_1(X1)
| c4_1(X1)
| c3_1(X1)
| ssSkC2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),
[final] ).
cnf(c_0_95,negated_conjecture,
( ~ c3_1(a151)
| ~ c3_0 ),
c_0_73,
[final] ).
cnf(c_0_121,negated_conjecture,
( c4_2(X1,X2)
| c1_2(X1,X2)
| ~ c5_1(X1)
| ~ ndr1_1(X1)
| ~ c1_0
| ~ c3_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_69])]),
[final] ).
cnf(c_0_122,negated_conjecture,
( ssSkC0
| ~ c4_2(X1,a142)
| ~ c1_1(X1)
| ~ ssSkP0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_69])]),
[final] ).
cnf(c_0_123,negated_conjecture,
( c2_2(a155,a156)
| c5_1(X1)
| c1_1(X1)
| c4_1(X1)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_69])]),
[final] ).
cnf(c_0_124,negated_conjecture,
( c5_2(a155,a156)
| c5_1(X1)
| c1_1(X1)
| c4_1(X1)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_69])]),
[final] ).
cnf(c_0_125,negated_conjecture,
( c1_2(a155,a156)
| c5_1(X1)
| c1_1(X1)
| c4_1(X1)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_69])]),
[final] ).
cnf(c_0_126,negated_conjecture,
( c5_1(X1)
| c1_1(X1)
| c4_1(X1)
| ~ c4_1(a155)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_69])]),
[final] ).
cnf(c_0_127,negated_conjecture,
( c3_2(X1,a142)
| ssSkC0
| ~ c1_1(X1)
| ~ ssSkP0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_69])]),
[final] ).
cnf(c_0_128,negated_conjecture,
( c5_2(X1,a149)
| c4_1(X1)
| c3_1(X1)
| ssSkC2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_69])]),
[final] ).
cnf(c_0_129,negated_conjecture,
( c5_2(a155,X1)
| c5_1(X2)
| c1_1(X2)
| c4_1(X2)
| ~ c4_2(a155,X1)
| ~ c2_2(a155,X1)
| ~ ndr1_1(a155)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_69])]),
[final] ).
cnf(c_0_130,negated_conjecture,
( c4_2(X1,a149)
| c4_1(X1)
| c3_1(X1)
| ssSkC2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_69])]),
[final] ).
cnf(c_0_131,negated_conjecture,
( c5_1(X1)
| c1_1(X1)
| ndr1_1(a155)
| c4_1(X1)
| ~ c4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_69])]),
[final] ).
cnf(c_0_132,negated_conjecture,
( ndr1_1(a148)
| c4_1(a148)
| ssSkC2
| ~ c1_0
| ~ c5_0 ),
inference(spm,[status(thm)],[c_0_90,c_0_91]),
[final] ).
cnf(c_0_133,negated_conjecture,
( ssSkC0
| ndr1_1(X1)
| ~ c1_1(X1)
| ~ ssSkP0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_69])]),
[final] ).
cnf(c_0_134,negated_conjecture,
( c5_1(X1)
| c4_0
| ~ c5_2(X1,a147)
| ~ ssSkC1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_69])]),
[final] ).
cnf(c_0_135,negated_conjecture,
( c5_1(X1)
| c4_0
| ~ c1_2(X1,a147)
| ~ ssSkC1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_69])]),
[final] ).
cnf(c_0_136,negated_conjecture,
( ndr1_1(a151)
| c4_1(a151)
| ssSkC2
| ~ c3_0 ),
inference(spm,[status(thm)],[c_0_95,c_0_91]),
[final] ).
cnf(c_0_137,negated_conjecture,
( c5_1(X1)
| c4_1(X1)
| c2_0
| ~ c4_1(a152) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_69])]),
[final] ).
cnf(c_0_138,negated_conjecture,
( c5_1(X1)
| c4_1(X1)
| c2_0
| ~ c1_1(a152) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_69])]),
[final] ).
cnf(c_0_139,negated_conjecture,
( c3_2(X1,a147)
| c5_1(X1)
| c4_0
| ~ ssSkC1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_69])]),
[final] ).
cnf(c_0_140,negated_conjecture,
( c5_1(X1)
| c4_1(X1)
| c3_1(a152)
| c2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_69])]),
[final] ).
cnf(c_0_141,negated_conjecture,
( c5_1(X1)
| ndr1_1(X1)
| c4_0
| ~ ssSkC1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_69])]),
[final] ).
cnf(c_0_142,negated_conjecture,
( c2_0
| ~ c2_2(a145,X1)
| ~ c5_2(a145,X1)
| ~ c1_2(a145,X1)
| ~ ndr1_1(a145) ),
c_0_101,
[final] ).
cnf(c_0_143,negated_conjecture,
( c3_0
| ~ ssSkC3
| ~ c5_2(a154,X1)
| ~ c1_2(a154,X1)
| ~ ndr1_1(a154) ),
c_0_102,
[final] ).
cnf(c_0_144,negated_conjecture,
( c3_2(a144,X1)
| c4_2(a144,X1)
| ~ c5_2(a144,X1)
| ~ ndr1_1(a144)
| ~ c4_0 ),
c_0_103,
[final] ).
cnf(c_0_145,negated_conjecture,
( c5_2(a150,X1)
| c3_0
| ~ ssSkC2
| ~ c4_2(a150,X1)
| ~ ndr1_1(a150) ),
c_0_104,
[final] ).
cnf(c_0_146,negated_conjecture,
( ssSkP0(X1)
| ~ c1_2(X1,a141) ),
c_0_105,
[final] ).
cnf(c_0_147,negated_conjecture,
( ssSkP0(X1)
| ~ c5_2(X1,a141) ),
c_0_106,
[final] ).
cnf(c_0_148,negated_conjecture,
( ssSkP0(X1)
| ~ c2_2(X1,a141) ),
c_0_107,
[final] ).
cnf(c_0_149,negated_conjecture,
( c3_0
| ~ ssSkC2
| ~ c4_1(a150) ),
c_0_108,
[final] ).
cnf(c_0_150,negated_conjecture,
( ndr1_1(X1)
| ssSkP0(X1) ),
clause11,
[final] ).
cnf(c_0_151,negated_conjecture,
( c3_0
| ~ ssSkC3
| ~ c5_1(a154) ),
c_0_109,
[final] ).
cnf(c_0_152,negated_conjecture,
( c5_1(a148)
| ~ c5_0
| ~ c1_0 ),
c_0_110,
[final] ).
cnf(c_0_153,negated_conjecture,
( c1_1(a154)
| c3_0
| ~ ssSkC3 ),
c_0_111,
[final] ).
cnf(c_0_154,negated_conjecture,
( ssSkC1
| ~ c3_1(a146) ),
c_0_112,
[final] ).
cnf(c_0_155,negated_conjecture,
( ssSkC3
| ~ c5_1(a153) ),
c_0_113,
[final] ).
cnf(c_0_156,negated_conjecture,
( ssSkC3
| ~ c1_1(a153) ),
c_0_114,
[final] ).
cnf(c_0_157,negated_conjecture,
( c2_0
| ~ c5_1(a145) ),
c_0_115,
[final] ).
cnf(c_0_158,negated_conjecture,
( c5_1(a144)
| ~ c4_0 ),
c_0_116,
[final] ).
cnf(c_0_159,negated_conjecture,
( c4_1(a146)
| ssSkC1 ),
clause10,
[final] ).
cnf(c_0_160,negated_conjecture,
( c3_1(a145)
| c2_0 ),
clause7,
[final] ).
cnf(c_0_161,negated_conjecture,
( c5_0
| c2_0
| c1_0 ),
clause9,
[final] ).
cnf(c_0_162,negated_conjecture,
( ~ c2_1(a148)
| ~ c5_0
| ~ c1_0 ),
c_0_117,
[final] ).
cnf(c_0_163,negated_conjecture,
( ~ ssSkC0
| ~ c1_1(a143)
| ~ c2_0 ),
c_0_118,
[final] ).
cnf(c_0_164,negated_conjecture,
( ~ c4_1(a144)
| ~ c4_0 ),
c_0_119,
[final] ).
cnf(c_0_165,negated_conjecture,
( ~ c2_1(a151)
| ~ c3_0 ),
c_0_120,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN523-1 : TPTP v8.2.0. Released v2.1.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 14:46:08 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 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.17/0.47 # Version: 3.1.0
% 0.17/0.47 # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # new_bool_3 with pid 23505 completed with status 1
% 0.17/0.47 # Result found by new_bool_3
% 0.17/0.47 # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.17/0.47 # H----_011_C07_F1_PI_AE_OS_S1U with pid 23511 completed with status 1
% 0.17/0.47 # Result found by H----_011_C07_F1_PI_AE_OS_S1U
% 0.17/0.47 # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 163s (1) cores
% 0.17/0.47 # Preprocessing time : 0.001 s
% 0.17/0.47
% 0.17/0.47 # No proof found!
% 0.17/0.47 # SZS status Satisfiable
% 0.17/0.47 # SZS output start Saturation
% See solution above
% 0.17/0.47 # Parsed axioms : 55
% 0.17/0.47 # Removed by relevancy pruning/SinE : 0
% 0.17/0.47 # Initial clauses : 55
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 55
% 0.17/0.47 # Processed clauses : 80
% 0.17/0.47 # ...of these trivial : 0
% 0.17/0.47 # ...subsumed : 1
% 0.17/0.47 # ...remaining for further processing : 79
% 0.17/0.47 # Other redundant clauses eliminated : 0
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 2
% 0.17/0.47 # Backward-rewritten : 28
% 0.17/0.47 # Generated clauses : 12
% 0.17/0.47 # ...of the previous two non-redundant : 27
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 0
% 0.17/0.47 # Paramodulations : 12
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 0
% 0.17/0.47 # Disequality decompositions : 0
% 0.17/0.47 # Total rewrite steps : 28
% 0.17/0.47 # ...of those cached : 27
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 49
% 0.17/0.47 # Positive orientable unit clauses : 1
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 0
% 0.17/0.47 # Non-unit-clauses : 48
% 0.17/0.47 # Current number of unprocessed clauses: 0
% 0.17/0.47 # ...number of literals in the above : 0
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 30
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 450
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 59
% 0.17/0.47 # Non-unit clause-clause subsumptions : 3
% 0.17/0.47 # Unit Clause-clause subsumption calls : 3
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 1
% 0.17/0.47 # BW rewrite match successes : 1
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 2481
% 0.17/0.47 # Search garbage collected termcells : 176
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.007 s
% 0.17/0.47 # System time : 0.002 s
% 0.17/0.47 # Total time : 0.009 s
% 0.17/0.47 # Maximum resident set size: 1916 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.009 s
% 0.17/0.47 # System time : 0.004 s
% 0.17/0.47 # Total time : 0.013 s
% 0.17/0.47 # Maximum resident set size: 1736 pages
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------