TSTP Solution File: SYN516-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN516-1 : TPTP v8.1.2. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:00 EDT 2023
% Result : Timeout 0.40s 300.11s
% Output : None
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_76)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_72,negated_conjecture,
ndr1_0,
inference(spm,[status(thm)],[c_0_69,c_0_70]),
[final] ).
cnf(c_0_74,negated_conjecture,
( ssSkC4
| ~ c2_1(a43) ),
clause20,
[final] ).
cnf(c_0_75,negated_conjecture,
( ssSkC0
| c2_1(X1)
| ndr1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]),
[final] ).
cnf(c_0_84,negated_conjecture,
( ssSkC2
| c3_2(X1,a36)
| c3_2(X1,X2)
| c2_2(X1,X2)
| c5_1(X1)
| ~ ndr1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_72])]),
[final] ).
cnf(c_0_85,negated_conjecture,
( ndr1_1(a44)
| ~ ssSkC4
| ~ c5_0 ),
clause25,
[final] ).
cnf(c_0_86,negated_conjecture,
( ndr1_1(a34)
| ~ c4_0
| ~ c1_0 ),
clause40,
[final] ).
cnf(c_0_87,negated_conjecture,
( ssSkC0
| ndr1_1(a43)
| ssSkC4 ),
inference(spm,[status(thm)],[c_0_74,c_0_75]),
[final] ).
cnf(c_0_88,negated_conjecture,
( ndr1_1(a39)
| ssSkC3 ),
clause9,
[final] ).
cnf(c_0_100,negated_conjecture,
( c3_2(X1,X2)
| c4_0
| c5_2(X1,X2)
| c5_0
| ~ c4_2(X1,X2)
| ~ c1_2(X1,a27)
| ~ ndr1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_72])]),
[final] ).
cnf(c_0_101,negated_conjecture,
( c3_2(X1,X2)
| c4_0
| c5_2(X1,X2)
| c5_0
| ~ c4_2(X1,X2)
| ~ c5_2(X1,a27)
| ~ ndr1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_72])]),
[final] ).
cnf(c_0_102,negated_conjecture,
( c3_2(X1,X2)
| c4_0
| c4_2(X1,a27)
| c5_2(X1,X2)
| c5_0
| ~ c4_2(X1,X2)
| ~ ndr1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_72])]),
[final] ).
cnf(c_0_103,negated_conjecture,
( c3_1(X1)
| ~ ssSkC0
| ~ c3_2(X1,X2)
| ~ c5_2(X1,X2)
| ~ c1_2(X1,a29)
| ~ c1_2(X1,X2)
| ~ ndr1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_72])]),
[final] ).
cnf(c_0_104,negated_conjecture,
( c2_2(X1,a29)
| c3_1(X1)
| ~ ssSkC0
| ~ c3_2(X1,X2)
| ~ c5_2(X1,X2)
| ~ c1_2(X1,X2)
| ~ ndr1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_72])]),
[final] ).
cnf(c_0_105,negated_conjecture,
( c4_2(X1,X2)
| c2_2(X1,X2)
| c1_0
| ~ c5_2(X1,X2)
| ~ c4_1(X1)
| ~ ndr1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_72])]),
[final] ).
cnf(c_0_106,negated_conjecture,
( ssSkC2
| c3_2(X1,X2)
| c2_2(X1,X2)
| c5_1(X1)
| ~ c1_2(X1,a36)
| ~ ndr1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_72])]),
[final] ).
cnf(c_0_107,negated_conjecture,
( ssSkC2
| c3_2(X1,X2)
| c2_2(X1,X2)
| c5_1(X1)
| ~ c5_2(X1,a36)
| ~ ndr1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_72])]),
[final] ).
cnf(c_0_108,negated_conjecture,
( ssSkC2
| c3_2(a44,a36)
| c3_2(a44,X1)
| c2_2(a44,X1)
| c5_1(a44)
| ~ c5_0
| ~ ssSkC4 ),
inference(spm,[status(thm)],[c_0_84,c_0_85]),
[final] ).
cnf(c_0_109,negated_conjecture,
( ssSkC2
| c3_2(a34,a36)
| c3_2(a34,X1)
| c2_2(a34,X1)
| c5_1(a34)
| ~ c4_0
| ~ c1_0 ),
inference(spm,[status(thm)],[c_0_84,c_0_86]),
[final] ).
cnf(c_0_110,negated_conjecture,
( ssSkC2
| ssSkC0
| c3_2(a43,a36)
| c3_2(a43,X1)
| c2_2(a43,X1)
| c5_1(a43)
| ssSkC4 ),
inference(spm,[status(thm)],[c_0_84,c_0_87]),
[final] ).
cnf(c_0_111,negated_conjecture,
( ssSkC2
| c3_2(a39,a36)
| c3_2(a39,X1)
| c2_2(a39,X1)
| c5_1(a39)
| ssSkC3 ),
inference(spm,[status(thm)],[c_0_84,c_0_88]),
[final] ).
cnf(c_0_112,negated_conjecture,
( c4_1(X1)
| ~ c5_2(X1,a38)
| ~ c5_1(X1)
| ~ c3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_72])]),
[final] ).
cnf(c_0_113,negated_conjecture,
( c1_2(a39,X1)
| ssSkC3
| ~ c5_2(a39,X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_88]),
[final] ).
cnf(c_0_114,negated_conjecture,
( ssSkC0
| c2_1(X1)
| ~ c5_2(X1,a28) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_72])]),
[final] ).
cnf(c_0_115,negated_conjecture,
( ssSkC0
| c2_1(X1)
| ~ c3_2(X1,a28) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_72])]),
[final] ).
cnf(c_0_116,negated_conjecture,
( c5_1(X1)
| c4_1(X1)
| ~ ssSkC2
| ~ c2_2(X1,a37) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_72])]),
[final] ).
cnf(c_0_117,negated_conjecture,
( c1_2(X1,a38)
| c4_1(X1)
| ~ c5_1(X1)
| ~ c3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_72])]),
[final] ).
cnf(c_0_118,negated_conjecture,
( c3_2(X1,a38)
| c4_1(X1)
| ~ c5_1(X1)
| ~ c3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_72])]),
[final] ).
cnf(c_0_119,negated_conjecture,
( c4_2(X1,a37)
| c5_1(X1)
| c4_1(X1)
| ~ ssSkC2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_72])]),
[final] ).
cnf(c_0_120,negated_conjecture,
( c3_2(X1,a37)
| c5_1(X1)
| c4_1(X1)
| ~ ssSkC2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_72])]),
[final] ).
cnf(c_0_121,negated_conjecture,
( c4_1(X1)
| ndr1_1(X1)
| ~ c5_1(X1)
| ~ c3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_72])]),
[final] ).
cnf(c_0_122,negated_conjecture,
( c5_1(X1)
| c4_1(X1)
| ndr1_1(X1)
| ~ ssSkC2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_72])]),
[final] ).
cnf(c_0_123,negated_conjecture,
( c5_0
| ~ ssSkC1
| ~ c4_2(a31,a32) ),
clause43,
[final] ).
cnf(c_0_124,negated_conjecture,
( c5_0
| ~ ssSkC1
| ~ c4_2(a31,a33) ),
clause41,
[final] ).
cnf(c_0_125,negated_conjecture,
( c5_0
| ~ ssSkC1
| ~ c5_2(a31,a33) ),
clause42,
[final] ).
cnf(c_0_126,negated_conjecture,
( c3_0
| ~ ssSkC3
| ~ c3_2(a41,a42) ),
clause39,
[final] ).
cnf(c_0_127,negated_conjecture,
( c1_0
| ~ ssSkC5
| ~ c5_2(a48,a49) ),
clause37,
[final] ).
cnf(c_0_128,negated_conjecture,
( c1_0
| ~ ssSkC5
| ~ c1_2(a48,a49) ),
clause36,
[final] ).
cnf(c_0_129,negated_conjecture,
( c1_2(a34,a35)
| ~ c4_0
| ~ c1_0 ),
clause47,
[final] ).
cnf(c_0_130,negated_conjecture,
( c1_2(a44,a45)
| ~ ssSkC4
| ~ c5_0 ),
clause38,
[final] ).
cnf(c_0_131,negated_conjecture,
( c3_2(a31,a32)
| c5_0
| ~ ssSkC1 ),
clause33,
[final] ).
cnf(c_0_132,negated_conjecture,
( c5_2(a31,a32)
| c5_0
| ~ ssSkC1 ),
clause34,
[final] ).
cnf(c_0_133,negated_conjecture,
( c2_2(a31,a33)
| c5_0
| ~ ssSkC1 ),
clause32,
[final] ).
cnf(c_0_134,negated_conjecture,
( c4_2(a41,a42)
| c3_0
| ~ ssSkC3 ),
clause29,
[final] ).
cnf(c_0_135,negated_conjecture,
( c5_2(a41,a42)
| c3_0
| ~ ssSkC3 ),
clause28,
[final] ).
cnf(c_0_136,negated_conjecture,
( c3_0
| ~ ssSkC3
| ~ c2_1(a41) ),
clause30,
[final] ).
cnf(c_0_137,negated_conjecture,
( c4_1(a44)
| ~ ssSkC4
| ~ c5_0 ),
clause27,
[final] ).
cnf(c_0_138,negated_conjecture,
( c3_1(a44)
| ~ ssSkC4
| ~ c5_0 ),
clause26,
[final] ).
cnf(c_0_139,negated_conjecture,
( c2_2(a39,a40)
| ssSkC3 ),
clause22,
[final] ).
cnf(c_0_140,negated_conjecture,
( c1_1(a31)
| c5_0
| ~ ssSkC1 ),
clause17,
[final] ).
cnf(c_0_141,negated_conjecture,
( ndr1_1(a31)
| c5_0
| ~ ssSkC1 ),
clause16,
[final] ).
cnf(c_0_142,negated_conjecture,
( ndr1_1(a41)
| c3_0
| ~ ssSkC3 ),
clause15,
[final] ).
cnf(c_0_143,negated_conjecture,
( c4_1(a48)
| c1_0
| ~ ssSkC5 ),
clause13,
[final] ).
cnf(c_0_144,negated_conjecture,
( ndr1_1(a48)
| c1_0
| ~ ssSkC5 ),
clause12,
[final] ).
cnf(c_0_145,negated_conjecture,
( c1_2(a39,a40)
| ssSkC3 ),
clause21,
[final] ).
cnf(c_0_146,negated_conjecture,
( ssSkC1
| ~ c1_1(a30) ),
clause23,
[final] ).
cnf(c_0_147,negated_conjecture,
( ssSkC4
| ~ c5_1(a43) ),
clause19,
[final] ).
cnf(c_0_148,negated_conjecture,
( ssSkC5
| ~ c3_1(a47) ),
clause18,
[final] ).
cnf(c_0_149,negated_conjecture,
( c5_0
| ~ c4_0
| ~ c2_0 ),
clause35,
[final] ).
cnf(c_0_150,negated_conjecture,
( c3_1(a30)
| ssSkC1 ),
clause11,
[final] ).
cnf(c_0_151,negated_conjecture,
( c2_1(a39)
| ssSkC3 ),
clause10,
[final] ).
cnf(c_0_152,negated_conjecture,
( ~ c4_2(a34,a35)
| ~ c4_0
| ~ c1_0 ),
clause52,
[final] ).
cnf(c_0_153,negated_conjecture,
( ~ c5_2(a34,a35)
| ~ c4_0
| ~ c1_0 ),
clause51,
[final] ).
cnf(c_0_154,negated_conjecture,
( ~ ssSkC4
| ~ c4_2(a44,a45)
| ~ c5_0 ),
clause45,
[final] ).
cnf(c_0_155,negated_conjecture,
( ~ ssSkC4
| ~ c2_2(a44,a45)
| ~ c5_0 ),
clause46,
[final] ).
cnf(c_0_156,negated_conjecture,
( ~ c1_1(a34)
| ~ c4_0
| ~ c1_0 ),
clause49,
[final] ).
cnf(c_0_157,negated_conjecture,
( ~ c2_1(a34)
| ~ c4_0
| ~ c1_0 ),
clause48,
[final] ).
cnf(c_0_158,negated_conjecture,
( ~ c3_1(a46)
| ~ c2_0 ),
clause24,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SYN516-1 : TPTP v8.1.2. Released v2.1.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 17:54:00 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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/tmp/tmp.BUqEg0Aaut/E---3.1_23557.p
% 0.40/300.11 # Version: 3.1pre001
% 0.40/300.11 # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.40/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/300.11 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.40/300.11 # Starting new_bool_3 with 300s (1) cores
% 0.40/300.11 # Starting new_bool_1 with 300s (1) cores
% 0.40/300.11 # Starting sh5l with 300s (1) cores
% 0.40/300.11 # G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with pid 23758 completed with status 1
% 0.40/300.11 # Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1
% 0.40/300.11 # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.40/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/300.11 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.40/300.11 # No SInE strategy applied
% 0.40/300.11 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.40/300.11 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/300.11 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 811s (1) cores
% 0.40/300.11 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 151s (1) cores
% 0.40/300.11 # Starting G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.40/300.11 # Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.40/300.11 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.40/300.11 # H----_011_C07_F1_PI_AE_OS_S1U with pid 23762 completed with status 1
% 0.40/300.11 # Result found by H----_011_C07_F1_PI_AE_OS_S1U
% 0.40/300.11 # Preprocessing class: FSLSSLSMSSSNFFN.
% 0.40/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/300.11 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.40/300.11 # No SInE strategy applied
% 0.40/300.11 # Search class: FGHNF-FFMM00-SFFFFFNN
% 0.40/300.11 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/300.11 # Starting H----_011_C07_F1_PI_AE_OS_S1U with 811s (1) cores
% 0.40/300.11 # Preprocessing time : 0.004 s
% 0.40/300.11
% 0.40/300.11 # No proof found!
% 0.40/300.11 # SZS status Satisfiable
% 0.40/300.11 # SZS output start Saturation
% See solution above
% 0.40/300.11 # Parsed axioms : 71
% 0.40/300.11 # Removed by relevancy pruning/SinE : 0
% 0.40/300.11 # Initial clauses : 71
% 0.40/300.11 # Removed in clause preprocessing : 0
% 0.40/300.11 # Initial clauses in saturation : 71
% 0.40/300.11 # Processed clauses : 104
% 0.40/300.11 # ...of these trivial : 0
% 0.40/300.11 # ...subsumed : 2
% 0.40/300.11 # ...remaining for further processing : 102
% 0.40/300.11 # Other redundant clauses eliminated : 0
% 0.40/300.11 # Clauses deleted for lack of memory : 0
% 0.40/300.11 # Backward-subsumed : 5
% 0.40/300.11 # Backward-rewritten : 30
% 0.40/300.11 # Generated clauses : 26
% 0.40/300.11 # ...of the previous two non-redundant : 43
% 0.40/300.11 # ...aggressively subsumed : 0
% 0.40/300.11 # Contextual simplify-reflections : 0
% 0.40/300.11 # Paramodulations : 26
% 0.40/300.11 # Factorizations : 0
% 0.40/300.11 # NegExts : 0
% 0.40/300.11 # Equation resolutions : 0
% 0.40/300.11 # Total rewrite steps : 30
% 0.40/300.11 # Propositional unsat checks : 0
% 0.40/300.11 # Propositional check models : 0
% 0.40/300.11 # Propositional check unsatisfiable : 0
% 0.40/300.11 # Propositional clauses : 0
% 0.40/300.11 # Propositional clauses after purity: 0
% 0.40/300.11 # Propositional unsat core size : 0
% 0.40/300.11 # Propositional preprocessing time : 0.000
% 0.40/300.11 # Propositional encoding time : 0.000
% 0.40/300.11 # Propositional solver time : 0.000
% 0.40/300.11 # Success case prop preproc time : 0.000
% 0.40/300.11 # Success case prop encoding time : 0.000
% 0.40/300.11 # Success case prop solver time : 0.000
% 0.40/300.11 # Current number of processed clauses : 67
% 0.40/300.11 # Positive orientable unit clauses : 1
% 0.40/300.11 # Positive unorientable unit clauses: 0
% 0.40/300.11 # Negative unit clauses : 0
% 0.40/300.11 # Non-unit-clauses : 66
% 0.40/300.11 # Current number of unprocessed clauses: 0
% 0.40/300.11 # ...number of literals in the above : 0
% 0.40/300.11 # Current number of archived formulas : 0
% 0.40/300.11 # Current number of archived clauses : 35
% 0.40/300.11 # Clause-clause subsumption calls (NU) : 739
% 0.40/300.11 # Rec. Clause-clause subsumption calls : 313
% 0.40/300.11 # Non-unit clause-clause subsumptions : 7
% 0.40/300.11 # Unit Clause-clause subsumption calls : 5
% 0.40/300.11 # Rewrite failures with RHS unbound : 0
% 0.40/300.11 # BW rewrite match attempts : 1
% 0.40/300.11 # BW rewrite match successes : 1
% 0.40/300.11 # Condensation attempts : 0
% 0.40/300.11 # Condensation successes : 0
% 0.40/300.11 # Termbank termtop insertions : 2531
% 0.40/300.11
% 0.40/300.11 # -------------------------------------------------
% 0.40/300.11 # User time : 0.009 s
% 0.40/300.11 # System time : 0.003 s
% 0.40/300.11 # Total time : 0.012 s
% 0.40/300.11 # Maximum resident set size: 1784 pages
% 0.40/300.11
% 0.40/300.11 # -------------------------------------------------
% 0.40/300.11 # User time : 0.030 s
% 0.40/300.11 # System time : 0.024 s
% 0.40/300.11 # Total time : 0.054 s
% 0.40/300.11 # Maximum resident set size: 1740 pages
% 0.40/300.11 % E---3.1 exiting
% 0.40/300.11 % E---3.1 exiting
%------------------------------------------------------------------------------