TSTP Solution File: SYN494-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN494-1 : TPTP v8.1.2. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:16:46 EDT 2023
% Result : Satisfiable 0.20s 0.51s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_65)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_48,negated_conjecture,
( hskp8
| hskp9
| hskp2 ),
clause13,
[final] ).
cnf(c_0_52,negated_conjecture,
ndr1_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50]),
[final] ).
cnf(c_0_53,negated_conjecture,
( c3_1(X1)
| c3_1(X2)
| c0_1(X2)
| hskp0
| ~ c1_1(X1)
| ~ c1_1(X2)
| ~ c2_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
[final] ).
cnf(c_0_54,negated_conjecture,
( c1_1(a53)
| ~ hskp1 ),
clause33,
[final] ).
cnf(c_0_55,negated_conjecture,
( ~ c3_1(a53)
| ~ hskp1 ),
clause47,
[final] ).
cnf(c_0_59,negated_conjecture,
( c1_1(a52)
| ~ hskp5 ),
clause26,
[final] ).
cnf(c_0_60,negated_conjecture,
( c2_1(a52)
| ~ hskp5 ),
clause25,
[final] ).
cnf(c_0_61,negated_conjecture,
( ~ c3_1(a52)
| ~ hskp5 ),
clause43,
[final] ).
cnf(c_0_62,negated_conjecture,
( ~ c0_1(a53)
| ~ hskp1 ),
clause48,
[final] ).
cnf(c_0_64,negated_conjecture,
( c0_1(X1)
| c2_1(X1)
| hskp10
| hskp11
| ~ c1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_52])]),
[final] ).
cnf(c_0_67,negated_conjecture,
( c1_1(X1)
| c3_1(X1)
| c2_1(X2)
| hskp3
| ~ c1_1(X2)
| ~ c3_1(X2)
| ~ c2_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_52])]),
[final] ).
cnf(c_0_68,negated_conjecture,
( c1_1(a58)
| ~ hskp2 ),
clause31,
[final] ).
cnf(c_0_69,negated_conjecture,
( c3_1(a58)
| ~ hskp2 ),
clause32,
[final] ).
cnf(c_0_70,negated_conjecture,
( c1_1(X1)
| c0_1(X1)
| c0_1(X2)
| c2_1(X1)
| hskp4
| ~ c3_1(X2)
| ~ c2_1(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_52])]),
[final] ).
cnf(c_0_71,negated_conjecture,
( c3_1(a49)
| ~ hskp0 ),
clause34,
[final] ).
cnf(c_0_72,negated_conjecture,
( c2_1(a49)
| ~ hskp0 ),
clause35,
[final] ).
cnf(c_0_73,negated_conjecture,
( c3_1(X1)
| c0_1(X1)
| hskp0
| ~ c1_1(X1)
| ~ hskp5 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_59]),c_0_60]),c_0_61]),
[final] ).
cnf(c_0_74,negated_conjecture,
( hskp0
| ~ c2_1(a53)
| ~ hskp1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_54]),c_0_55]),
[final] ).
cnf(c_0_75,negated_conjecture,
( c2_1(a53)
| hskp10
| hskp11
| ~ hskp1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_64]),c_0_54]),
[final] ).
cnf(c_0_76,negated_conjecture,
( c1_1(a51)
| ~ hskp4 ),
clause28,
[final] ).
cnf(c_0_77,negated_conjecture,
( ~ c2_1(a51)
| ~ hskp4 ),
clause44,
[final] ).
cnf(c_0_78,negated_conjecture,
( c3_1(X1)
| c0_1(X1)
| c0_1(X2)
| c2_1(X1)
| c2_1(X2)
| ~ c1_1(X2)
| ~ c3_1(X3)
| ~ c0_1(X3)
| ~ c2_1(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_52])]),
[final] ).
cnf(c_0_79,negated_conjecture,
( c0_1(X1)
| hskp6
| hskp7
| ~ c1_1(X1)
| ~ c3_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_52])]),
[final] ).
cnf(c_0_80,negated_conjecture,
( c0_1(a60)
| ~ hskp11 ),
clause15,
[final] ).
cnf(c_0_81,negated_conjecture,
( c2_1(a60)
| ~ hskp11 ),
clause14,
[final] ).
cnf(c_0_82,negated_conjecture,
( c3_1(a60)
| ~ hskp11 ),
clause16,
[final] ).
cnf(c_0_83,negated_conjecture,
( c1_1(X1)
| c3_1(X1)
| c2_1(a58)
| hskp3
| ~ c2_1(X1)
| ~ hskp2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),
[final] ).
cnf(c_0_84,negated_conjecture,
( c1_1(X1)
| c0_1(a49)
| c0_1(X1)
| c2_1(X1)
| hskp4
| ~ hskp0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]),
[final] ).
cnf(c_0_85,negated_conjecture,
( hskp0
| ~ hskp1
| ~ hskp5 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_73]),c_0_54]),c_0_55]),
[final] ).
cnf(c_0_86,negated_conjecture,
( hskp0
| hskp10
| hskp11
| ~ hskp1 ),
inference(spm,[status(thm)],[c_0_74,c_0_75]),
[final] ).
cnf(c_0_87,negated_conjecture,
( c3_1(a59)
| ~ hskp10 ),
clause18,
[final] ).
cnf(c_0_88,negated_conjecture,
( c2_1(a59)
| ~ hskp10 ),
clause17,
[final] ).
cnf(c_0_89,negated_conjecture,
( c1_1(X1)
| c3_1(X1)
| hskp3
| ~ c3_1(a51)
| ~ c2_1(X1)
| ~ hskp4 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_76]),c_0_77]),
[final] ).
cnf(c_0_90,negated_conjecture,
( c3_1(a56)
| ~ hskp8 ),
clause20,
[final] ).
cnf(c_0_91,negated_conjecture,
( c2_1(a56)
| ~ hskp8 ),
clause21,
[final] ).
cnf(c_0_92,negated_conjecture,
( ~ c0_1(a56)
| ~ hskp8 ),
clause39,
[final] ).
cnf(c_0_93,negated_conjecture,
( c3_1(a55)
| ~ hskp7 ),
clause22,
[final] ).
cnf(c_0_94,negated_conjecture,
( c2_1(a55)
| ~ hskp7 ),
clause23,
[final] ).
cnf(c_0_95,negated_conjecture,
( ~ c0_1(a58)
| ~ hskp2 ),
clause46,
[final] ).
cnf(c_0_97,negated_conjecture,
( c3_1(X1)
| c0_1(X2)
| c0_1(X1)
| c2_1(X2)
| c2_1(X1)
| hskp6
| hskp7
| ~ c1_1(X2)
| ~ c1_1(X3)
| ~ c3_1(X3)
| ~ c2_1(X3) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]),
[final] ).
cnf(c_0_98,negated_conjecture,
( c3_1(X1)
| c0_1(X2)
| c0_1(X1)
| c2_1(X2)
| c2_1(X1)
| ~ c1_1(X2)
| ~ hskp11 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_80]),c_0_81]),c_0_82]),
[final] ).
cnf(c_0_99,negated_conjecture,
( c3_1(X1)
| c3_1(X2)
| c0_1(X1)
| c2_1(a58)
| hskp0
| hskp3
| ~ c1_1(X1)
| ~ c2_1(X2)
| ~ hskp2 ),
inference(spm,[status(thm)],[c_0_53,c_0_83]),
[final] ).
cnf(c_0_100,negated_conjecture,
( c1_1(X1)
| c0_1(a49)
| c0_1(X1)
| c2_1(X1)
| hskp4
| ~ hskp1
| ~ hskp5 ),
inference(spm,[status(thm)],[c_0_84,c_0_85]),
[final] ).
cnf(c_0_101,negated_conjecture,
( c0_1(a49)
| c0_1(X1)
| c2_1(X1)
| hskp4
| hskp10
| hskp11
| ~ hskp1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_86]),c_0_64]),
[final] ).
cnf(c_0_102,negated_conjecture,
( c1_1(X1)
| c0_1(a59)
| c0_1(X1)
| c2_1(X1)
| hskp4
| ~ hskp10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_87]),c_0_88]),
[final] ).
cnf(c_0_103,negated_conjecture,
( c3_1(X1)
| c3_1(X2)
| c0_1(X1)
| hskp0
| hskp3
| ~ c1_1(X1)
| ~ c3_1(a51)
| ~ c2_1(X2)
| ~ hskp4 ),
inference(spm,[status(thm)],[c_0_53,c_0_89]),
[final] ).
cnf(c_0_104,negated_conjecture,
( c1_1(X1)
| c0_1(X1)
| c2_1(X1)
| hskp4
| ~ hskp8 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_90]),c_0_91]),c_0_92]),
[final] ).
cnf(c_0_105,negated_conjecture,
( c1_1(X1)
| c0_1(a55)
| c0_1(X1)
| c2_1(X1)
| hskp4
| ~ hskp7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_93]),c_0_94]),
[final] ).
cnf(c_0_106,negated_conjecture,
( c1_1(X1)
| c0_1(X1)
| c2_1(X1)
| hskp4
| ~ c2_1(a58)
| ~ hskp2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_69]),c_0_95]),
[final] ).
cnf(c_0_107,negated_conjecture,
( c3_1(X1)
| c0_1(X1)
| hskp1
| hskp5
| ~ c2_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_52])]),
[final] ).
cnf(c_0_108,negated_conjecture,
( c2_1(a58)
| hskp10
| hskp11
| ~ hskp2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_64]),c_0_68]),
[final] ).
cnf(c_0_109,negated_conjecture,
( hskp6
| hskp7
| ~ c1_1(a56)
| ~ hskp8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_79]),c_0_90]),
[final] ).
cnf(c_0_110,negated_conjecture,
( hskp6
| hskp7
| ~ hskp2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_79]),c_0_69]),c_0_68]),
[final] ).
cnf(c_0_111,negated_conjecture,
( c1_1(a50)
| ~ hskp3 ),
clause29,
[final] ).
cnf(c_0_112,negated_conjecture,
( c1_1(a54)
| ~ hskp6 ),
clause24,
[final] ).
cnf(c_0_113,negated_conjecture,
( c3_1(a57)
| ~ hskp9 ),
clause19,
[final] ).
cnf(c_0_114,negated_conjecture,
( c0_1(a50)
| ~ hskp3 ),
clause30,
[final] ).
cnf(c_0_115,negated_conjecture,
( c0_1(a51)
| ~ hskp4 ),
clause27,
[final] ).
cnf(c_0_116,negated_conjecture,
( ~ c1_1(a49)
| ~ hskp0 ),
clause49,
[final] ).
cnf(c_0_117,negated_conjecture,
( ~ c2_1(a50)
| ~ hskp3 ),
clause45,
[final] ).
cnf(c_0_118,negated_conjecture,
( ~ c3_1(a54)
| ~ hskp6 ),
clause41,
[final] ).
cnf(c_0_119,negated_conjecture,
( ~ c2_1(a54)
| ~ hskp6 ),
clause42,
[final] ).
cnf(c_0_120,negated_conjecture,
( ~ c1_1(a55)
| ~ hskp7 ),
clause40,
[final] ).
cnf(c_0_121,negated_conjecture,
( ~ c1_1(a57)
| ~ hskp9 ),
clause38,
[final] ).
cnf(c_0_122,negated_conjecture,
( ~ c2_1(a57)
| ~ hskp9 ),
clause37,
[final] ).
cnf(c_0_123,negated_conjecture,
( ~ c1_1(a59)
| ~ hskp10 ),
clause36,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN494-1 : TPTP v8.1.2. Released v2.1.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 18:02:50 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/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.bSI2wK5gAp/E---3.1_21477.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSLSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG 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 # sh5l with pid 21561 completed with status 1
% 0.20/0.51 # Result found by sh5l
% 0.20/0.51 # Preprocessing class: FSMSSLSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG 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 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FGHNF-FFMF00-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 21568 completed with status 1
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSMSSLSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG 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 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FGHNF-FFMF00-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 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 : 56
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 56
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 56
% 0.20/0.51 # Processed clauses : 172
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 37
% 0.20/0.51 # ...remaining for further processing : 135
% 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 : 1
% 0.20/0.51 # Backward-rewritten : 12
% 0.20/0.51 # Generated clauses : 76
% 0.20/0.51 # ...of the previous two non-redundant : 62
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 25
% 0.20/0.51 # Paramodulations : 76
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 19
% 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 : 66
% 0.20/0.51 # Positive orientable unit clauses : 1
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 0
% 0.20/0.51 # Non-unit-clauses : 65
% 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 : 69
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 4359
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 510
% 0.20/0.51 # Non-unit clause-clause subsumptions : 63
% 0.20/0.51 # Unit Clause-clause subsumption calls : 1
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 1
% 0.20/0.51 # BW rewrite match successes : 1
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 2396
% 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: 1816 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.013 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.016 s
% 0.20/0.51 # Maximum resident set size: 1724 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------