TSTP Solution File: SYN302-1.003 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN302-1.003 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:44:05 EDT 2024
% Result : Satisfiable 0.20s 0.51s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_72)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_144,negated_conjecture,
( q_0_2
| ~ q_0_0
| ~ q_1_0 ),
c_0_72,
[final] ).
cnf(c_0_145,negated_conjecture,
( q_0_2
| ~ q_0_0
| ~ p_1_0 ),
c_0_73,
[final] ).
cnf(c_0_146,negated_conjecture,
( q_0_2
| ~ p_0_0
| ~ q_1_0 ),
c_0_74,
[final] ).
cnf(c_0_147,negated_conjecture,
( q_0_2
| ~ p_0_0
| ~ p_1_0 ),
c_0_75,
[final] ).
cnf(c_0_148,negated_conjecture,
( q_0_1
| ~ q_0_2
| ~ q_1_2 ),
c_0_76,
[final] ).
cnf(c_0_149,negated_conjecture,
( q_0_1
| ~ q_0_2
| ~ p_1_2 ),
c_0_77,
[final] ).
cnf(c_0_150,negated_conjecture,
( q_0_1
| ~ p_0_2
| ~ q_1_2 ),
c_0_78,
[final] ).
cnf(c_0_151,negated_conjecture,
( q_0_1
| ~ p_0_2
| ~ p_1_2 ),
c_0_79,
[final] ).
cnf(c_0_152,negated_conjecture,
( q_2_0
| ~ q_2_1
| ~ q_0_1 ),
c_0_80,
[final] ).
cnf(c_0_153,negated_conjecture,
( q_2_0
| ~ p_2_1
| ~ q_0_1 ),
c_0_81,
[final] ).
cnf(c_0_154,negated_conjecture,
( q_2_0
| ~ q_2_1
| ~ p_0_1 ),
c_0_82,
[final] ).
cnf(c_0_155,negated_conjecture,
( q_2_0
| ~ p_2_1
| ~ p_0_1 ),
c_0_83,
[final] ).
cnf(c_0_156,negated_conjecture,
( q_2_2
| ~ q_2_0
| ~ q_0_0 ),
c_0_84,
[final] ).
cnf(c_0_157,negated_conjecture,
( q_2_2
| ~ p_2_0
| ~ q_0_0 ),
c_0_85,
[final] ).
cnf(c_0_158,negated_conjecture,
( q_2_2
| ~ q_2_0
| ~ p_0_0 ),
c_0_86,
[final] ).
cnf(c_0_159,negated_conjecture,
( q_2_2
| ~ p_2_0
| ~ p_0_0 ),
c_0_87,
[final] ).
cnf(c_0_160,negated_conjecture,
( q_1_0
| ~ q_1_1
| ~ q_2_1 ),
c_0_88,
[final] ).
cnf(c_0_161,negated_conjecture,
( q_1_0
| ~ q_1_1
| ~ p_2_1 ),
c_0_89,
[final] ).
cnf(c_0_162,negated_conjecture,
( q_1_0
| ~ p_1_1
| ~ q_2_1 ),
c_0_90,
[final] ).
cnf(c_0_163,negated_conjecture,
( q_1_0
| ~ p_1_1
| ~ p_2_1 ),
c_0_91,
[final] ).
cnf(c_0_164,negated_conjecture,
( q_1_2
| ~ q_1_0
| ~ q_2_0 ),
c_0_92,
[final] ).
cnf(c_0_165,negated_conjecture,
( q_1_2
| ~ q_1_0
| ~ p_2_0 ),
c_0_93,
[final] ).
cnf(c_0_166,negated_conjecture,
( q_1_2
| ~ p_1_0
| ~ q_2_0 ),
c_0_94,
[final] ).
cnf(c_0_167,negated_conjecture,
( q_1_2
| ~ p_1_0
| ~ p_2_0 ),
c_0_95,
[final] ).
cnf(c_0_168,negated_conjecture,
( q_1_1
| ~ q_1_2
| ~ q_2_2 ),
c_0_96,
[final] ).
cnf(c_0_169,negated_conjecture,
( q_1_1
| ~ q_1_2
| ~ p_2_2 ),
c_0_97,
[final] ).
cnf(c_0_170,negated_conjecture,
( q_1_1
| ~ p_1_2
| ~ q_2_2 ),
c_0_98,
[final] ).
cnf(c_0_171,negated_conjecture,
( q_1_1
| ~ p_1_2
| ~ p_2_2 ),
c_0_99,
[final] ).
cnf(c_0_172,negated_conjecture,
( p_2_0
| ~ q_2_1
| ~ q_0_1 ),
c_0_100,
[final] ).
cnf(c_0_173,negated_conjecture,
( p_2_0
| ~ p_2_1
| ~ q_0_1 ),
c_0_101,
[final] ).
cnf(c_0_174,negated_conjecture,
( p_2_0
| ~ q_2_1
| ~ p_0_1 ),
c_0_102,
[final] ).
cnf(c_0_175,negated_conjecture,
( p_2_0
| ~ p_2_1
| ~ p_0_1 ),
c_0_103,
[final] ).
cnf(c_0_176,negated_conjecture,
( p_2_2
| ~ q_2_0
| ~ q_0_0 ),
c_0_104,
[final] ).
cnf(c_0_177,negated_conjecture,
( p_2_2
| ~ p_2_0
| ~ q_0_0 ),
c_0_105,
[final] ).
cnf(c_0_178,negated_conjecture,
( p_2_2
| ~ q_2_0
| ~ p_0_0 ),
c_0_106,
[final] ).
cnf(c_0_179,negated_conjecture,
( p_2_2
| ~ p_2_0
| ~ p_0_0 ),
c_0_107,
[final] ).
cnf(c_0_180,negated_conjecture,
( p_1_0
| ~ q_1_1
| ~ q_2_1 ),
c_0_108,
[final] ).
cnf(c_0_181,negated_conjecture,
( p_1_0
| ~ q_1_1
| ~ p_2_1 ),
c_0_109,
[final] ).
cnf(c_0_182,negated_conjecture,
( p_1_0
| ~ p_1_1
| ~ q_2_1 ),
c_0_110,
[final] ).
cnf(c_0_183,negated_conjecture,
( p_1_0
| ~ p_1_1
| ~ p_2_1 ),
c_0_111,
[final] ).
cnf(c_0_184,negated_conjecture,
( p_1_2
| ~ q_1_0
| ~ q_2_0 ),
c_0_112,
[final] ).
cnf(c_0_185,negated_conjecture,
( p_1_2
| ~ q_1_0
| ~ p_2_0 ),
c_0_113,
[final] ).
cnf(c_0_186,negated_conjecture,
( p_1_2
| ~ p_1_0
| ~ q_2_0 ),
c_0_114,
[final] ).
cnf(c_0_187,negated_conjecture,
( p_1_2
| ~ p_1_0
| ~ p_2_0 ),
c_0_115,
[final] ).
cnf(c_0_188,negated_conjecture,
( p_0_2
| ~ q_0_0
| ~ q_1_0 ),
c_0_116,
[final] ).
cnf(c_0_189,negated_conjecture,
( p_0_2
| ~ q_0_0
| ~ p_1_0 ),
c_0_117,
[final] ).
cnf(c_0_190,negated_conjecture,
( p_0_2
| ~ p_0_0
| ~ q_1_0 ),
c_0_118,
[final] ).
cnf(c_0_191,negated_conjecture,
( p_0_2
| ~ p_0_0
| ~ p_1_0 ),
c_0_119,
[final] ).
cnf(c_0_192,negated_conjecture,
( p_1_1
| ~ q_1_2
| ~ q_2_2 ),
c_0_120,
[final] ).
cnf(c_0_193,negated_conjecture,
( p_1_1
| ~ q_1_2
| ~ p_2_2 ),
c_0_121,
[final] ).
cnf(c_0_194,negated_conjecture,
( p_1_1
| ~ p_1_2
| ~ q_2_2 ),
c_0_122,
[final] ).
cnf(c_0_195,negated_conjecture,
( p_1_1
| ~ p_1_2
| ~ p_2_2 ),
c_0_123,
[final] ).
cnf(c_0_196,negated_conjecture,
( p_0_1
| ~ q_0_2
| ~ q_1_2 ),
c_0_124,
[final] ).
cnf(c_0_197,negated_conjecture,
( p_0_1
| ~ q_0_2
| ~ p_1_2 ),
c_0_125,
[final] ).
cnf(c_0_198,negated_conjecture,
( p_0_1
| ~ p_0_2
| ~ q_1_2 ),
c_0_126,
[final] ).
cnf(c_0_199,negated_conjecture,
( p_0_1
| ~ p_0_2
| ~ p_1_2 ),
c_0_127,
[final] ).
cnf(c_0_200,negated_conjecture,
( p_0_0
| ~ q_0_1
| ~ q_1_1 ),
c_0_128,
[final] ).
cnf(c_0_201,negated_conjecture,
( p_0_0
| ~ q_0_1
| ~ p_1_1 ),
c_0_129,
[final] ).
cnf(c_0_202,negated_conjecture,
( p_0_0
| ~ p_0_1
| ~ q_1_1 ),
c_0_130,
[final] ).
cnf(c_0_203,negated_conjecture,
( q_0_0
| ~ q_0_1
| ~ q_1_1 ),
c_0_131,
[final] ).
cnf(c_0_204,negated_conjecture,
( q_0_0
| ~ q_0_1
| ~ p_1_1 ),
c_0_132,
[final] ).
cnf(c_0_205,negated_conjecture,
( q_0_0
| ~ p_0_1
| ~ q_1_1 ),
c_0_133,
[final] ).
cnf(c_0_206,negated_conjecture,
( q_0_0
| ~ p_0_1
| ~ p_1_1 ),
c_0_134,
[final] ).
cnf(c_0_207,negated_conjecture,
( q_2_1
| ~ q_2_2
| ~ q_0_2 ),
c_0_135,
[final] ).
cnf(c_0_208,negated_conjecture,
( q_2_1
| ~ p_2_2
| ~ q_0_2 ),
c_0_136,
[final] ).
cnf(c_0_209,negated_conjecture,
( q_2_1
| ~ q_2_2
| ~ p_0_2 ),
c_0_137,
[final] ).
cnf(c_0_210,negated_conjecture,
( q_2_1
| ~ p_2_2
| ~ p_0_2 ),
c_0_138,
[final] ).
cnf(c_0_211,negated_conjecture,
( p_2_1
| ~ q_2_2
| ~ q_0_2 ),
c_0_139,
[final] ).
cnf(c_0_212,negated_conjecture,
( p_2_1
| ~ p_2_2
| ~ q_0_2 ),
c_0_140,
[final] ).
cnf(c_0_213,negated_conjecture,
( p_2_1
| ~ q_2_2
| ~ p_0_2 ),
c_0_141,
[final] ).
cnf(c_0_214,negated_conjecture,
( p_2_1
| ~ p_2_2
| ~ p_0_2 ),
c_0_142,
[final] ).
cnf(c_0_215,negated_conjecture,
( p_0_0
| ~ p_0_1
| ~ p_1_1 ),
c_0_143,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN302-1.003 : TPTP v8.2.0. Released v1.2.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 13:56:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 31819 completed with status 1
% 0.20/0.51 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.20/0.51 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FHUNF-FFMF00-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.20/0.51 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 31825 completed with status 1
% 0.20/0.51 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.20/0.51 # Preprocessing class: FSLSSLSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FHUNF-FFMF00-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.20/0.51 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # No proof found!
% 0.20/0.51 # SZS status Satisfiable
% 0.20/0.51 # SZS output start Saturation
% See solution above
% 0.20/0.51 # Parsed axioms : 72
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 72
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 72
% 0.20/0.51 # Processed clauses : 144
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 144
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 0
% 0.20/0.51 # ...of the previous two non-redundant : 0
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 0
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 0
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 72
% 0.20/0.51 # Positive orientable unit clauses : 0
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 0
% 0.20/0.51 # Non-unit-clauses : 72
% 0.20/0.51 # Current number of unprocessed clauses: 0
% 0.20/0.51 # ...number of literals in the above : 0
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 72
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 432
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 432
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 1874
% 0.20/0.51 # Search garbage collected termcells : 126
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.010 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.012 s
% 0.20/0.51 # Maximum resident set size: 1720 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.048 s
% 0.20/0.51 # System time : 0.009 s
% 0.20/0.51 # Total time : 0.057 s
% 0.20/0.51 # Maximum resident set size: 1752 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------