TSTP Solution File: NUM285-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM285-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 18:46:15 EDT 2023
% Result : Timeout 0.37s 300.15s
% Output : None
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named q1_is_b0_plus_b1_3)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_47,negated_conjecture,
( q1
| b0
| ~ b1 ),
q1_is_b0_plus_b1_3,
[final] ).
cnf(c_0_48,negated_conjecture,
( b1
| ~ a1 ),
a1_is_b1_2,
[final] ).
cnf(c_0_51,negated_conjecture,
( b0
| q1
| ~ a1 ),
inference(spm,[status(thm)],[c_0_47,c_0_48]),
[final] ).
cnf(c_0_52,negated_conjecture,
( p1
| a1
| ~ a0 ),
p1_is_a0_plus_a1_4,
[final] ).
cnf(c_0_53,negated_conjecture,
( a0
| b0 ),
a0_not_b0_1,
[final] ).
cnf(c_0_55,negated_conjecture,
( b3
| ~ q3 ),
inference(csr,[status(thm)],[c_0_49,c_0_50]),
[final] ).
cnf(c_0_56,negated_conjecture,
( a1
| ~ b1 ),
a1_is_b1_1,
[final] ).
cnf(c_0_57,negated_conjecture,
( q1
| b1
| ~ b0 ),
q1_is_b0_plus_b1_4,
[final] ).
cnf(c_0_58,negated_conjecture,
( ~ a0
| ~ b0 ),
a0_not_b0_2,
[final] ).
cnf(c_0_60,negated_conjecture,
( b0
| b1
| ~ q1 ),
q1_is_b0_plus_b1_1,
[final] ).
cnf(c_0_61,negated_conjecture,
( ~ q1
| ~ b0
| ~ b1 ),
q1_is_b0_plus_b1_2,
[final] ).
cnf(c_0_62,negated_conjecture,
( a3
| ~ b3 ),
a3_is_b3_1,
[final] ).
cnf(c_0_63,negated_conjecture,
( b3
| ~ q2 ),
inference(csr,[status(thm)],[c_0_54,c_0_55]),
[final] ).
cnf(c_0_64,negated_conjecture,
( q2
| q1
| ~ b2 ),
q2_is_q1_plus_b2_3,
[final] ).
cnf(c_0_65,negated_conjecture,
( b2
| ~ a2 ),
a2_is_b2_2,
[final] ).
cnf(c_0_66,negated_conjecture,
( p1
| a0
| ~ a1 ),
p1_is_a0_plus_a1_3,
[final] ).
cnf(c_0_67,negated_conjecture,
( q1
| a1
| ~ b0 ),
inference(spm,[status(thm)],[c_0_56,c_0_57]),
[final] ).
cnf(c_0_71,negated_conjecture,
( ~ p1
| ~ a0
| ~ a1 ),
p1_is_a0_plus_a1_2,
[final] ).
cnf(c_0_72,negated_conjecture,
( b0
| a1
| ~ q1 ),
inference(spm,[status(thm)],[c_0_56,c_0_60]),
[final] ).
cnf(c_0_73,negated_conjecture,
( ~ b0
| ~ q1
| ~ a1 ),
inference(spm,[status(thm)],[c_0_61,c_0_48]),
[final] ).
cnf(c_0_74,negated_conjecture,
( a0
| a1
| ~ p1 ),
p1_is_a0_plus_a1_1,
[final] ).
cnf(c_0_76,negated_conjecture,
( a3
| ~ q2 ),
inference(spm,[status(thm)],[c_0_62,c_0_63]),
[final] ).
cnf(c_0_77,negated_conjecture,
( q2
| q1
| ~ a2 ),
inference(spm,[status(thm)],[c_0_64,c_0_65]),
[final] ).
cnf(c_0_78,negated_conjecture,
( p2
| a2
| ~ p1 ),
p2_is_p1_plus_a2_4,
[final] ).
cnf(c_0_79,negated_conjecture,
( q1
| p1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_59]),c_0_68]),
[final] ).
cnf(c_0_81,negated_conjecture,
( b4
| ~ q4 ),
inference(csr,[status(thm)],[c_0_69,c_0_70]),
[final] ).
cnf(c_0_84,negated_conjecture,
( a2
| ~ b2 ),
a2_is_b2_1,
[final] ).
cnf(c_0_85,negated_conjecture,
( q2
| b2
| ~ q1 ),
q2_is_q1_plus_b2_4,
[final] ).
cnf(c_0_89,negated_conjecture,
( q2
| q1
| p2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]),
[final] ).
cnf(c_0_90,negated_conjecture,
( a4
| ~ b4 ),
a4_is_b4_1,
[final] ).
cnf(c_0_91,negated_conjecture,
( b4
| ~ q3 ),
inference(csr,[status(thm)],[c_0_80,c_0_81]),
[final] ).
cnf(c_0_92,negated_conjecture,
( q3
| q2
| ~ b3 ),
q3_is_q2_plus_b3_3,
[final] ).
cnf(c_0_93,negated_conjecture,
( b3
| ~ a3 ),
a3_is_b3_2,
[final] ).
cnf(c_0_95,negated_conjecture,
( a3
| ~ p3 ),
inference(csr,[status(thm)],[c_0_82,c_0_83]),
[final] ).
cnf(c_0_96,negated_conjecture,
( p2
| p1
| ~ a2 ),
p2_is_p1_plus_a2_3,
[final] ).
cnf(c_0_97,negated_conjecture,
( q2
| a2
| ~ q1 ),
inference(spm,[status(thm)],[c_0_84,c_0_85]),
[final] ).
cnf(c_0_98,negated_conjecture,
( ~ q1
| ~ p1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_86]),c_0_87]),
[final] ).
cnf(c_0_100,negated_conjecture,
( q1
| b2
| ~ q2 ),
q2_is_q1_plus_b2_1,
[final] ).
cnf(c_0_102,negated_conjecture,
( a4
| ~ q3 ),
inference(spm,[status(thm)],[c_0_90,c_0_91]),
[final] ).
cnf(c_0_103,negated_conjecture,
( q3
| q2
| ~ a3 ),
inference(spm,[status(thm)],[c_0_92,c_0_93]),
[final] ).
cnf(c_0_104,negated_conjecture,
( a3
| ~ p2 ),
inference(csr,[status(thm)],[c_0_94,c_0_95]),
[final] ).
cnf(c_0_105,negated_conjecture,
( q2
| p2
| p1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_79]),
[final] ).
cnf(c_0_107,negated_conjecture,
( ~ q2
| ~ q1
| ~ b2 ),
q2_is_q1_plus_b2_2,
[final] ).
cnf(c_0_108,negated_conjecture,
( ~ p2
| ~ p1
| ~ a2 ),
p2_is_p1_plus_a2_2,
[final] ).
cnf(c_0_109,negated_conjecture,
( q1
| a2
| ~ q2 ),
inference(spm,[status(thm)],[c_0_84,c_0_100]),
[final] ).
cnf(c_0_111,negated_conjecture,
( q3
| q2
| ~ p2 ),
inference(spm,[status(thm)],[c_0_103,c_0_104]),
[final] ).
cnf(c_0_112,negated_conjecture,
( p3
| p2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_105]),c_0_106]),
[final] ).
cnf(c_0_113,negated_conjecture,
( ~ q2
| ~ q1
| ~ a2 ),
inference(spm,[status(thm)],[c_0_107,c_0_65]),
[final] ).
cnf(c_0_114,negated_conjecture,
( p1
| a2
| ~ p2 ),
p2_is_p1_plus_a2_1,
[final] ).
cnf(c_0_118,negated_conjecture,
p5,
equal_sum_2,
[final] ).
cnf(c_0_119,negated_conjecture,
( q1
| ~ q2
| ~ p2
| ~ p1 ),
inference(spm,[status(thm)],[c_0_108,c_0_109]),
[final] ).
cnf(c_0_121,negated_conjecture,
( p1
| ~ q2
| ~ q1
| ~ p2 ),
inference(spm,[status(thm)],[c_0_113,c_0_114]),
[final] ).
cnf(c_0_122,negated_conjecture,
( q4
| q3
| ~ b4 ),
q4_is_q3_plus_b4_3,
[final] ).
cnf(c_0_123,negated_conjecture,
( b4
| ~ a4 ),
a4_is_b4_2,
[final] ).
cnf(c_0_125,negated_conjecture,
( a4
| ~ p4 ),
inference(csr,[status(thm)],[c_0_115,c_0_116]),
[final] ).
cnf(c_0_130,negated_conjecture,
( q4
| q3
| ~ a4 ),
inference(spm,[status(thm)],[c_0_122,c_0_123]),
[final] ).
cnf(c_0_131,negated_conjecture,
( a4
| ~ p3 ),
inference(csr,[status(thm)],[c_0_124,c_0_125]),
[final] ).
cnf(c_0_133,negated_conjecture,
a5,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_118])]),c_0_127]),
[final] ).
cnf(c_0_134,negated_conjecture,
( p4
| p3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_128]),c_0_129]),
[final] ).
cnf(c_0_135,negated_conjecture,
( q4
| q3
| ~ p3 ),
inference(spm,[status(thm)],[c_0_130,c_0_131]),
[final] ).
cnf(c_0_136,negated_conjecture,
( q4
| q3
| ~ p4 ),
inference(spm,[status(thm)],[c_0_130,c_0_125]),
[final] ).
cnf(c_0_137,negated_conjecture,
( q3
| q2
| ~ p3 ),
inference(spm,[status(thm)],[c_0_103,c_0_95]),
[final] ).
cnf(c_0_138,negated_conjecture,
( a4
| ~ q4 ),
inference(spm,[status(thm)],[c_0_90,c_0_81]),
[final] ).
cnf(c_0_139,negated_conjecture,
( a3
| ~ q3 ),
inference(spm,[status(thm)],[c_0_62,c_0_55]),
[final] ).
cnf(c_0_140,negated_conjecture,
b5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_132,c_0_133])]),
[final] ).
cnf(c_0_141,negated_conjecture,
q5,
equal_sum_1,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.15 % Problem : NUM285-1 : TPTP v8.1.2. Released v1.1.0.
% 0.13/0.16 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n013.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 13:30:14 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 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.nO3BRQJFEC/E---3.1_31354.p
% 0.37/300.15 # Version: 3.1pre001
% 0.37/300.15 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.37/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.15 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.37/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.37/300.15 # Starting new_bool_1 with 300s (1) cores
% 0.37/300.15 # Starting sh5l with 300s (1) cores
% 0.37/300.15 # sh5l with pid 31435 completed with status 1
% 0.37/300.15 # Result found by sh5l
% 0.37/300.15 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.37/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.15 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.37/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.37/300.15 # Starting new_bool_1 with 300s (1) cores
% 0.37/300.15 # Starting sh5l with 300s (1) cores
% 0.37/300.15 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.37/300.15 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.37/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/300.15 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.37/300.15 # SAT001_MinMin_p005000_rr_RG with pid 31438 completed with status 1
% 0.37/300.15 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.37/300.15 # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.37/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.15 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.37/300.15 # Starting new_bool_3 with 300s (1) cores
% 0.37/300.15 # Starting new_bool_1 with 300s (1) cores
% 0.37/300.15 # Starting sh5l with 300s (1) cores
% 0.37/300.15 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.37/300.15 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.37/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/300.15 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.37/300.15 # Preprocessing time : 0.001 s
% 0.37/300.15 # Presaturation interreduction done
% 0.37/300.15
% 0.37/300.15 # No proof found!
% 0.37/300.15 # SZS status Satisfiable
% 0.37/300.15 # SZS output start Saturation
% See solution above
% 0.37/300.15 # Parsed axioms : 54
% 0.37/300.15 # Removed by relevancy pruning/SinE : 0
% 0.37/300.15 # Initial clauses : 54
% 0.37/300.15 # Removed in clause preprocessing : 0
% 0.37/300.15 # Initial clauses in saturation : 54
% 0.37/300.15 # Processed clauses : 144
% 0.37/300.15 # ...of these trivial : 5
% 0.37/300.15 # ...subsumed : 7
% 0.37/300.15 # ...remaining for further processing : 132
% 0.37/300.15 # Other redundant clauses eliminated : 0
% 0.37/300.15 # Clauses deleted for lack of memory : 0
% 0.37/300.15 # Backward-subsumed : 22
% 0.37/300.15 # Backward-rewritten : 2
% 0.37/300.15 # Generated clauses : 99
% 0.37/300.15 # ...of the previous two non-redundant : 48
% 0.37/300.15 # ...aggressively subsumed : 0
% 0.37/300.15 # Contextual simplify-reflections : 24
% 0.37/300.15 # Paramodulations : 99
% 0.37/300.15 # Factorizations : 0
% 0.37/300.15 # NegExts : 0
% 0.37/300.15 # Equation resolutions : 0
% 0.37/300.15 # Total rewrite steps : 15
% 0.37/300.15 # Propositional unsat checks : 0
% 0.37/300.15 # Propositional check models : 0
% 0.37/300.15 # Propositional check unsatisfiable : 0
% 0.37/300.15 # Propositional clauses : 0
% 0.37/300.15 # Propositional clauses after purity: 0
% 0.37/300.15 # Propositional unsat core size : 0
% 0.37/300.15 # Propositional preprocessing time : 0.000
% 0.37/300.15 # Propositional encoding time : 0.000
% 0.37/300.15 # Propositional solver time : 0.000
% 0.37/300.15 # Success case prop preproc time : 0.000
% 0.37/300.15 # Success case prop encoding time : 0.000
% 0.37/300.15 # Success case prop solver time : 0.000
% 0.37/300.15 # Current number of processed clauses : 66
% 0.37/300.15 # Positive orientable unit clauses : 4
% 0.37/300.15 # Positive unorientable unit clauses: 0
% 0.37/300.15 # Negative unit clauses : 0
% 0.37/300.15 # Non-unit-clauses : 62
% 0.37/300.15 # Current number of unprocessed clauses: 0
% 0.37/300.15 # ...number of literals in the above : 0
% 0.37/300.15 # Current number of archived formulas : 0
% 0.37/300.15 # Current number of archived clauses : 66
% 0.37/300.15 # Clause-clause subsumption calls (NU) : 2122
% 0.37/300.15 # Rec. Clause-clause subsumption calls : 1821
% 0.37/300.15 # Non-unit clause-clause subsumptions : 51
% 0.37/300.15 # Unit Clause-clause subsumption calls : 26
% 0.37/300.15 # Rewrite failures with RHS unbound : 0
% 0.37/300.15 # BW rewrite match attempts : 2
% 0.37/300.15 # BW rewrite match successes : 2
% 0.37/300.15 # Condensation attempts : 0
% 0.37/300.15 # Condensation successes : 0
% 0.37/300.15 # Termbank termtop insertions : 1340
% 0.37/300.15
% 0.37/300.15 # -------------------------------------------------
% 0.37/300.15 # User time : 0.006 s
% 0.37/300.15 # System time : 0.001 s
% 0.37/300.15 # Total time : 0.007 s
% 0.37/300.15 # Maximum resident set size: 1792 pages
% 0.37/300.15
% 0.37/300.15 # -------------------------------------------------
% 0.37/300.15 # User time : 0.007 s
% 0.37/300.15 # System time : 0.004 s
% 0.37/300.15 # Total time : 0.010 s
% 0.37/300.15 # Maximum resident set size: 1700 pages
% 0.37/300.15 % E---3.1 exiting
% 0.37/300.15 % E---3.1 exiting
%------------------------------------------------------------------------------