TSTP Solution File: SYN491-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN491-1 : TPTP v8.1.2. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : Sat May 4 10:08:52 EDT 2024
% Result : Satisfiable 0.21s 0.51s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_61)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_45,negated_conjecture,
( hskp1
| hskp2
| hskp8 ),
clause11,
[final] ).
cnf(c_0_52,negated_conjecture,
ndr1_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]),
[final] ).
cnf(c_0_63,negated_conjecture,
( c2_1(X1)
| c2_1(X2)
| c0_1(X1)
| c3_1(X1)
| hskp3
| ~ c3_1(X2)
| ~ c1_1(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
[final] ).
cnf(c_0_64,negated_conjecture,
( c3_1(a24)
| ~ hskp8 ),
c_0_53,
[final] ).
cnf(c_0_65,negated_conjecture,
( c1_1(a24)
| ~ hskp8 ),
c_0_54,
[final] ).
cnf(c_0_67,negated_conjecture,
( c0_1(X1)
| c3_1(X2)
| hskp0
| ~ c2_1(X1)
| ~ c2_1(X2)
| ~ c0_1(X2)
| ~ c1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_52])]),
[final] ).
cnf(c_0_68,negated_conjecture,
( c2_1(a20)
| ~ hskp7 ),
c_0_56,
[final] ).
cnf(c_0_69,negated_conjecture,
( c1_1(a20)
| ~ hskp7 ),
c_0_57,
[final] ).
cnf(c_0_70,negated_conjecture,
( ~ c0_1(a20)
| ~ hskp7 ),
c_0_58,
[final] ).
cnf(c_0_75,negated_conjecture,
( c2_1(X1)
| c0_1(X1)
| c1_1(X1)
| ~ c2_1(X2)
| ~ c3_1(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_52])]),
[final] ).
cnf(c_0_76,negated_conjecture,
( ~ c3_1(a22)
| ~ hskp1 ),
c_0_62,
[final] ).
cnf(c_0_77,negated_conjecture,
( c2_1(a24)
| c2_1(X1)
| c0_1(X1)
| c3_1(X1)
| hskp3
| ~ hskp8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),
[final] ).
cnf(c_0_78,negated_conjecture,
( ~ c2_1(a22)
| ~ hskp1 ),
c_0_66,
[final] ).
cnf(c_0_79,negated_conjecture,
( c3_1(X1)
| hskp0
| ~ c2_1(X1)
| ~ c0_1(X1)
| ~ hskp7 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),
[final] ).
cnf(c_0_82,negated_conjecture,
( ~ c3_1(a16)
| ~ hskp3 ),
c_0_71,
[final] ).
cnf(c_0_83,negated_conjecture,
( c2_1(X1)
| c0_1(X2)
| c3_1(X1)
| c3_1(X2)
| c1_1(X1)
| c1_1(X2)
| hskp4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_52])]),
[final] ).
cnf(c_0_84,negated_conjecture,
( ~ c1_1(a16)
| ~ hskp3 ),
c_0_73,
[final] ).
cnf(c_0_88,negated_conjecture,
( c0_1(X1)
| c0_1(X2)
| c3_1(X3)
| c1_1(X3)
| c1_1(X2)
| ~ c2_1(X1)
| ~ c0_1(X3)
| ~ c3_1(X1)
| ~ c3_1(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_52])]),
[final] ).
cnf(c_0_89,negated_conjecture,
( c2_1(X1)
| c0_1(X1)
| c1_1(X1)
| ~ c2_1(a24)
| ~ hskp8 ),
inference(spm,[status(thm)],[c_0_75,c_0_64]),
[final] ).
cnf(c_0_90,negated_conjecture,
( c2_1(a24)
| c0_1(a22)
| hskp3
| ~ hskp1
| ~ hskp8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),
[final] ).
cnf(c_0_91,negated_conjecture,
( c2_1(X1)
| c0_1(X1)
| c1_1(X1)
| hskp0
| ~ c2_1(X2)
| ~ c0_1(X2)
| ~ hskp7 ),
inference(spm,[status(thm)],[c_0_75,c_0_79]),
[final] ).
cnf(c_0_92,negated_conjecture,
( c2_1(a19)
| ~ hskp6 ),
c_0_80,
[final] ).
cnf(c_0_93,negated_conjecture,
( c0_1(a19)
| ~ hskp6 ),
c_0_81,
[final] ).
cnf(c_0_94,negated_conjecture,
( c2_1(a16)
| c0_1(X1)
| c3_1(X1)
| c1_1(X1)
| hskp4
| ~ hskp3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),
[final] ).
cnf(c_0_95,negated_conjecture,
( c0_1(a16)
| ~ hskp3 ),
c_0_85,
[final] ).
cnf(c_0_99,negated_conjecture,
( c2_1(a17)
| ~ hskp4 ),
c_0_86,
[final] ).
cnf(c_0_100,negated_conjecture,
( c0_1(a17)
| ~ hskp4 ),
c_0_87,
[final] ).
cnf(c_0_101,negated_conjecture,
( c2_1(X1)
| c0_1(X2)
| c0_1(X3)
| c3_1(X1)
| c3_1(X4)
| c1_1(X3)
| c1_1(X1)
| c1_1(X2)
| c1_1(X4)
| hskp4
| ~ c2_1(X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_83]),c_0_83]),c_0_83]),
[final] ).
cnf(c_0_102,negated_conjecture,
( c2_1(X1)
| c0_1(a22)
| c0_1(X1)
| c1_1(X1)
| hskp3
| ~ hskp1
| ~ hskp8 ),
inference(spm,[status(thm)],[c_0_89,c_0_90]),
[final] ).
cnf(c_0_103,negated_conjecture,
( c2_1(X1)
| c0_1(X1)
| c1_1(X1)
| hskp0
| ~ hskp6
| ~ hskp7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),
[final] ).
cnf(c_0_104,negated_conjecture,
( c2_1(a16)
| c0_1(X1)
| c0_1(X2)
| c3_1(X3)
| c1_1(X2)
| c1_1(X1)
| c1_1(X3)
| hskp4
| ~ c2_1(X2)
| ~ hskp3 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_94]),c_0_94]),c_0_94]),
[final] ).
cnf(c_0_105,negated_conjecture,
( hskp0
| ~ c2_1(a16)
| ~ hskp3
| ~ hskp7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_79]),c_0_95]),
[final] ).
cnf(c_0_106,negated_conjecture,
( ~ c2_1(a23)
| ~ hskp2 ),
c_0_96,
[final] ).
cnf(c_0_107,negated_conjecture,
( ~ c1_1(a23)
| ~ hskp2 ),
c_0_97,
[final] ).
cnf(c_0_108,negated_conjecture,
( ~ c0_1(a23)
| ~ hskp2 ),
c_0_98,
[final] ).
cnf(c_0_109,negated_conjecture,
( c2_1(X1)
| c0_1(X1)
| c1_1(X1)
| hskp0
| ~ hskp4
| ~ hskp7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_99]),c_0_100]),
[final] ).
cnf(c_0_120,negated_conjecture,
( c2_1(X1)
| c2_1(X2)
| c0_1(X3)
| c0_1(X2)
| c3_1(X1)
| c1_1(X3)
| c1_1(X1)
| c1_1(X2)
| hskp4
| ~ c2_1(X3) ),
inference(spm,[status(thm)],[c_0_75,c_0_83]),
[final] ).
cnf(c_0_121,negated_conjecture,
( c2_1(X1)
| c0_1(a22)
| c0_1(X2)
| c0_1(X3)
| c3_1(X4)
| c3_1(X1)
| c1_1(X4)
| c1_1(X3)
| c1_1(X1)
| c1_1(X2)
| hskp3
| hskp4
| ~ hskp1
| ~ hskp8 ),
inference(spm,[status(thm)],[c_0_101,c_0_102]),
[final] ).
cnf(c_0_122,negated_conjecture,
( c2_1(X1)
| c0_1(X2)
| c0_1(X3)
| c3_1(X4)
| c3_1(X1)
| c1_1(X4)
| c1_1(X3)
| c1_1(X1)
| c1_1(X2)
| hskp0
| hskp4
| ~ hskp6
| ~ hskp7 ),
inference(spm,[status(thm)],[c_0_101,c_0_103]),
[final] ).
cnf(c_0_123,negated_conjecture,
( c0_1(X1)
| c0_1(X2)
| c3_1(X3)
| c1_1(X3)
| c1_1(X2)
| c1_1(X1)
| hskp0
| hskp4
| ~ hskp3
| ~ hskp6
| ~ hskp7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_103]),c_0_105]),
[final] ).
cnf(c_0_124,negated_conjecture,
( c2_1(a16)
| c2_1(X1)
| c0_1(X2)
| c0_1(X1)
| c1_1(X2)
| c1_1(X1)
| hskp4
| ~ c2_1(X2)
| ~ hskp3 ),
inference(spm,[status(thm)],[c_0_75,c_0_94]),
[final] ).
cnf(c_0_125,negated_conjecture,
( c2_1(X1)
| c0_1(X1)
| c3_1(X1)
| c1_1(X1)
| hskp4 ),
inference(ef,[status(thm)],[c_0_83]),
[final] ).
cnf(c_0_126,negated_conjecture,
( c0_1(a22)
| hskp3
| ~ hskp1
| ~ hskp2
| ~ hskp8 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_102]),c_0_107]),c_0_108]),
[final] ).
cnf(c_0_127,negated_conjecture,
( hskp0
| ~ hskp2
| ~ hskp6
| ~ hskp7 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_103]),c_0_107]),c_0_108]),
[final] ).
cnf(c_0_128,negated_conjecture,
( hskp0
| ~ hskp2
| ~ hskp4
| ~ hskp7 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_109]),c_0_107]),c_0_108]),
[final] ).
cnf(c_0_129,negated_conjecture,
( c2_1(a21)
| ~ hskp0 ),
c_0_110,
[final] ).
cnf(c_0_130,negated_conjecture,
( c0_1(a21)
| ~ hskp0 ),
c_0_111,
[final] ).
cnf(c_0_131,negated_conjecture,
( c0_1(a18)
| ~ hskp5 ),
c_0_112,
[final] ).
cnf(c_0_132,negated_conjecture,
( c0_1(a24)
| ~ hskp8 ),
c_0_113,
[final] ).
cnf(c_0_133,negated_conjecture,
( hskp5
| hskp6
| hskp7 ),
clause10,
[final] ).
cnf(c_0_134,negated_conjecture,
( c1_1(a22)
| ~ hskp1 ),
c_0_114,
[final] ).
cnf(c_0_135,negated_conjecture,
( c1_1(a17)
| ~ hskp4 ),
c_0_115,
[final] ).
cnf(c_0_136,negated_conjecture,
( c1_1(a18)
| ~ hskp5 ),
c_0_116,
[final] ).
cnf(c_0_137,negated_conjecture,
( c1_1(a19)
| ~ hskp6 ),
c_0_117,
[final] ).
cnf(c_0_138,negated_conjecture,
( ~ c1_1(a21)
| ~ hskp0 ),
c_0_118,
[final] ).
cnf(c_0_139,negated_conjecture,
( ~ c2_1(a18)
| ~ hskp5 ),
c_0_119,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN491-1 : TPTP v8.1.2. Released v2.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n014.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 10:24:31 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.YzRyYsCMhK/E---3.1_26749.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSLSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 26827 completed with status 1
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSMSSLSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 901s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 151s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 151s (1) cores
% 0.21/0.51 # Starting sh5l with 146s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 26832 completed with status 1
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSMSSLSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 901s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # No proof found!
% 0.21/0.51 # SZS status Satisfiable
% 0.21/0.51 # SZS output start Saturation
% See solution above
% 0.21/0.51 # Parsed axioms : 44
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 44
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 44
% 0.21/0.51 # Processed clauses : 154
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 44
% 0.21/0.51 # ...remaining for further processing : 110
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 1
% 0.21/0.51 # Backward-rewritten : 10
% 0.21/0.51 # Generated clauses : 101
% 0.21/0.51 # ...of the previous two non-redundant : 68
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 22
% 0.21/0.51 # Paramodulations : 99
% 0.21/0.51 # Factorizations : 2
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 14
% 0.21/0.51 # ...of those cached : 13
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 56
% 0.21/0.51 # Positive orientable unit clauses : 1
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 0
% 0.21/0.51 # Non-unit-clauses : 55
% 0.21/0.51 # Current number of unprocessed clauses: 0
% 0.21/0.51 # ...number of literals in the above : 0
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 54
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 2728
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 391
% 0.21/0.51 # Non-unit clause-clause subsumptions : 67
% 0.21/0.51 # Unit Clause-clause subsumption calls : 3
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 1
% 0.21/0.51 # BW rewrite match successes : 1
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 3215
% 0.21/0.51 # Search garbage collected termcells : 96
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.008 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.011 s
% 0.21/0.51 # Maximum resident set size: 1692 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.043 s
% 0.21/0.51 # System time : 0.007 s
% 0.21/0.51 # Total time : 0.050 s
% 0.21/0.51 # Maximum resident set size: 1752 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------