TSTP Solution File: COM003_10 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COM003_10 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : Mon May 20 19:06:40 EDT 2024
% Result : Satisfiable 0.12s 0.42s
% Output : Saturation 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_9)
% Comments :
%------------------------------------------------------------------------------
tcf(c_0_21,plain,
! [X2: program,X4: program] :
( halts2(esk9_0,as_input(X2))
| halts2(X2,as_input(X2))
| halts2(esk7_1(X4),as_input(esk7_1(X4)))
| ~ halts2(X4,as_input(esk8_1(X4)))
| ~ outputs(X4,bad) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_22,plain,
! [X2: program,X4: program] :
( outputs(esk6_0,bad)
| halts2(X2,as_input(X2))
| ~ halts3(X4,esk5_1(X4),as_input(esk5_1(X4)))
| ~ outputs(X4,bad)
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ outputs(X4,good) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
tcf(c_0_23,plain,
! [X2: program,X4: program] :
( halts2(esk9_0,as_input(X2))
| halts2(X2,as_input(X2))
| ~ halts2(X4,as_input(esk8_1(X4)))
| ~ outputs(X4,bad)
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ outputs(X4,good) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_24,plain,
! [X2: program,X4: program] :
( outputs(esk6_0,bad)
| halts2(X2,as_input(X2))
| halts2(esk4_1(X4),as_input(esk4_1(X4)))
| ~ halts3(X4,esk5_1(X4),as_input(esk5_1(X4)))
| ~ outputs(X4,bad) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
tcf(c_0_25,plain,
! [X2: program,X4: program] :
( halts2(esk9_0,as_input(X2))
| halts2(X2,as_input(X2))
| ~ halts2(esk8_1(X4),as_input(esk8_1(X4)))
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ outputs(X4,good) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_26,plain,
! [X2: program,X4: program] :
( halts2(esk9_0,as_input(X2))
| halts2(X2,as_input(X2))
| halts2(esk7_1(X4),as_input(esk7_1(X4)))
| ~ halts2(esk8_1(X4),as_input(esk8_1(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_27,plain,
! [X2: program,X4: program] :
( halts2(esk7_1(X4),as_input(esk7_1(X4)))
| ~ halts2(X2,as_input(X2))
| ~ halts2(esk9_0,as_input(X2))
| ~ halts2(X4,as_input(esk8_1(X4)))
| ~ outputs(X4,bad) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_28,plain,
! [X2: program,X4: program] :
( outputs(esk6_0,good)
| halts2(esk4_1(X4),as_input(esk4_1(X4)))
| ~ halts2(X2,as_input(X2))
| ~ halts3(X4,esk5_1(X4),as_input(esk5_1(X4)))
| ~ outputs(X4,bad) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
tcf(c_0_29,plain,
! [X2: program,X4: program] :
( outputs(esk6_0,bad)
| halts2(X2,as_input(X2))
| ~ halts2(esk5_1(X4),as_input(esk5_1(X4)))
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ outputs(X4,good) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
tcf(c_0_30,plain,
! [X2: program,X4: program] :
( outputs(esk6_0,good)
| ~ halts2(X2,as_input(X2))
| ~ halts3(X4,esk5_1(X4),as_input(esk5_1(X4)))
| ~ outputs(X4,bad)
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ outputs(X4,good) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
tcf(c_0_31,plain,
! [X2: program,X4: program] :
( outputs(esk9_0,bad)
| halts2(X2,as_input(X2))
| halts2(esk7_1(X4),as_input(esk7_1(X4)))
| ~ halts2(X4,as_input(esk8_1(X4)))
| ~ outputs(X4,bad) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_32,plain,
! [X2: program,X4: program] :
( outputs(esk9_0,bad)
| halts2(X2,as_input(X2))
| ~ halts2(X4,as_input(esk8_1(X4)))
| ~ outputs(X4,bad)
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ outputs(X4,good) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_33,plain,
! [X2: program,X4: program] :
( halts2(esk6_0,as_input(X2))
| ~ outputs(X4,bad)
| ~ outputs(X4,good)
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ halts3(X4,esk5_1(X4),as_input(esk5_1(X4))) ),
inference(csr,[status(thm)],[c_0_10,c_0_11]),
[final] ).
tcf(c_0_34,plain,
! [X4: program,X2: program] :
( halts2(esk4_1(X2),as_input(esk4_1(X2)))
| halts2(esk6_0,as_input(X4))
| ~ outputs(X2,bad)
| ~ halts3(X2,esk5_1(X2),as_input(esk5_1(X2))) ),
inference(csr,[status(thm)],[c_0_12,c_0_13]),
[final] ).
tcf(c_0_35,plain,
! [X2: program,X4: program] :
( outputs(esk9_0,bad)
| halts2(X2,as_input(X2))
| ~ halts2(esk8_1(X4),as_input(esk8_1(X4)))
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ outputs(X4,good) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_36,plain,
! [X2: program,X4: program] :
( halts2(esk6_0,as_input(X2))
| ~ outputs(X4,good)
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ halts2(esk5_1(X4),as_input(esk5_1(X4))) ),
inference(csr,[status(thm)],[c_0_14,c_0_15]),
[final] ).
tcf(c_0_37,plain,
! [X2: program,X4: program] :
( outputs(esk6_0,good)
| halts2(esk4_1(X4),as_input(esk4_1(X4)))
| ~ halts2(X2,as_input(X2))
| ~ halts2(esk5_1(X4),as_input(esk5_1(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
tcf(c_0_38,plain,
! [X2: program,X4: program] :
( halts2(esk7_1(X4),as_input(esk7_1(X4)))
| ~ halts2(X2,as_input(X2))
| ~ halts2(esk9_0,as_input(X2))
| ~ halts2(esk8_1(X4),as_input(esk8_1(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_39,plain,
! [X2: program,X4: program] :
( outputs(esk6_0,good)
| ~ halts2(X2,as_input(X2))
| ~ halts2(esk5_1(X4),as_input(esk5_1(X4)))
| ~ halts3(X4,esk4_1(X4),as_input(esk4_1(X4)))
| ~ outputs(X4,good) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
tcf(c_0_40,plain,
! [X2: program,X4: program] :
( ~ halts2(X2,as_input(X2))
| ~ halts2(esk9_0,as_input(X2))
| ~ halts2(X4,as_input(esk8_1(X4)))
| ~ outputs(X4,bad)
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ outputs(X4,good) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_41,plain,
! [X2: program,X4: program] :
( ~ halts2(X2,as_input(X2))
| ~ halts2(esk9_0,as_input(X2))
| ~ halts2(esk8_1(X4),as_input(esk8_1(X4)))
| ~ halts2(X4,as_input(esk7_1(X4)))
| ~ outputs(X4,good) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_42,plain,
! [X2: program,X4: program] :
( outputs(esk9_0,bad)
| halts2(X2,as_input(X2))
| halts2(esk7_1(X4),as_input(esk7_1(X4)))
| ~ halts2(esk8_1(X4),as_input(esk8_1(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_43,plain,
! [X2: program,X4: program] :
( outputs(esk6_0,bad)
| halts2(X2,as_input(X2))
| halts2(esk4_1(X4),as_input(esk4_1(X4)))
| ~ halts2(esk5_1(X4),as_input(esk5_1(X4))) ),
inference(split_conjunct,[status(thm)],[c_0_7]),
[final] ).
tcf(c_0_44,plain,
! [X4: program,X2: program] :
( halts2(esk4_1(X2),as_input(esk4_1(X2)))
| halts2(esk6_0,as_input(X4))
| ~ halts2(esk5_1(X2),as_input(esk5_1(X2))) ),
inference(csr,[status(thm)],[c_0_16,c_0_17]),
[final] ).
tcf(c_0_45,plain,
! [X3: input,X2: program,X1: algorithm] :
( decides(algorithm_of(esk3_0),X2,X3)
| ~ decides(X1,esk1_1(X1),esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
tcf(c_0_46,plain,
! [X2: program,X3: input,X4: program,X5: program,X9: input] :
( outputs(X2,good)
| ~ halts2(X4,X3)
| ~ decides(algorithm_of(X2),X5,X9) ),
inference(split_conjunct,[status(thm)],[c_0_8]),
[final] ).
tcf(c_0_47,plain,
! [X2: program,X3: input,X4: program,X5: program,X9: input] :
( halts3(X2,X4,X3)
| ~ decides(algorithm_of(X2),X5,X9) ),
inference(csr,[status(thm)],[c_0_19,c_0_20]),
[final] ).
tcf(c_0_48,plain,
! [X2: program,X3: input,X4: program,X5: program,X9: input] :
( outputs(X2,bad)
| halts2(X4,X3)
| ~ decides(algorithm_of(X2),X5,X9) ),
inference(split_conjunct,[status(thm)],[c_0_8]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : COM003_10 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n010.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Sun May 19 10:30:52 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.12/0.42 # Version: 3.1.0
% 0.12/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 # Starting sh5l with 300s (1) cores
% 0.12/0.42 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10286 completed with status 1
% 0.12/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 # No SInE strategy applied
% 0.12/0.42 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.12/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.42 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.12/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.42 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.42 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.12/0.42 # Starting new_bool_3 with 136s (1) cores
% 0.12/0.42 # G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with pid 10299 completed with status 1
% 0.12/0.42 # Result found by G-E--_208_C47_F1_SE_CS_SP_PS_S0Y
% 0.12/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 # No SInE strategy applied
% 0.12/0.42 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.12/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.42 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.12/0.42 # Preprocessing time : 0.002 s
% 0.12/0.42 # Presaturation interreduction done
% 0.12/0.42
% 0.12/0.42 # No proof found!
% 0.12/0.42 # SZS status Satisfiable
% 0.12/0.42 # SZS output start Saturation
% See solution above
% 0.12/0.42 # Parsed axioms : 16
% 0.12/0.42 # Removed by relevancy pruning/SinE : 0
% 0.12/0.42 # Initial clauses : 45
% 0.12/0.42 # Removed in clause preprocessing : 12
% 0.12/0.42 # Initial clauses in saturation : 33
% 0.12/0.42 # Processed clauses : 61
% 0.12/0.42 # ...of these trivial : 0
% 0.12/0.42 # ...subsumed : 0
% 0.12/0.42 # ...remaining for further processing : 61
% 0.12/0.42 # Other redundant clauses eliminated : 0
% 0.12/0.42 # Clauses deleted for lack of memory : 0
% 0.12/0.42 # Backward-subsumed : 5
% 0.12/0.42 # Backward-rewritten : 0
% 0.12/0.42 # Generated clauses : 0
% 0.12/0.42 # ...of the previous two non-redundant : 0
% 0.12/0.42 # ...aggressively subsumed : 0
% 0.12/0.42 # Contextual simplify-reflections : 5
% 0.12/0.42 # Paramodulations : 0
% 0.12/0.42 # Factorizations : 0
% 0.12/0.42 # NegExts : 0
% 0.12/0.42 # Equation resolutions : 0
% 0.12/0.42 # Disequality decompositions : 0
% 0.12/0.42 # Total rewrite steps : 0
% 0.12/0.42 # ...of those cached : 0
% 0.12/0.42 # Propositional unsat checks : 0
% 0.12/0.42 # Propositional check models : 0
% 0.12/0.42 # Propositional check unsatisfiable : 0
% 0.12/0.42 # Propositional clauses : 0
% 0.12/0.42 # Propositional clauses after purity: 0
% 0.12/0.42 # Propositional unsat core size : 0
% 0.12/0.42 # Propositional preprocessing time : 0.000
% 0.12/0.42 # Propositional encoding time : 0.000
% 0.12/0.42 # Propositional solver time : 0.000
% 0.12/0.42 # Success case prop preproc time : 0.000
% 0.12/0.42 # Success case prop encoding time : 0.000
% 0.12/0.42 # Success case prop solver time : 0.000
% 0.12/0.42 # Current number of processed clauses : 28
% 0.12/0.42 # Positive orientable unit clauses : 0
% 0.12/0.42 # Positive unorientable unit clauses: 0
% 0.12/0.42 # Negative unit clauses : 0
% 0.12/0.42 # Non-unit-clauses : 28
% 0.12/0.42 # Current number of unprocessed clauses: 0
% 0.12/0.42 # ...number of literals in the above : 0
% 0.12/0.42 # Current number of archived formulas : 0
% 0.12/0.42 # Current number of archived clauses : 33
% 0.12/0.42 # Clause-clause subsumption calls (NU) : 838
% 0.12/0.42 # Rec. Clause-clause subsumption calls : 124
% 0.12/0.42 # Non-unit clause-clause subsumptions : 10
% 0.12/0.42 # Unit Clause-clause subsumption calls : 0
% 0.12/0.42 # Rewrite failures with RHS unbound : 0
% 0.12/0.42 # BW rewrite match attempts : 0
% 0.12/0.42 # BW rewrite match successes : 0
% 0.12/0.42 # Condensation attempts : 0
% 0.12/0.42 # Condensation successes : 0
% 0.12/0.42 # Termbank termtop insertions : 4366
% 0.12/0.42 # Search garbage collected termcells : 369
% 0.12/0.42
% 0.12/0.42 # -------------------------------------------------
% 0.12/0.42 # User time : 0.009 s
% 0.12/0.42 # System time : 0.004 s
% 0.12/0.42 # Total time : 0.013 s
% 0.12/0.42 # Maximum resident set size: 1844 pages
% 0.12/0.42
% 0.12/0.42 # -------------------------------------------------
% 0.12/0.42 # User time : 0.037 s
% 0.12/0.42 # System time : 0.011 s
% 0.12/0.42 # Total time : 0.048 s
% 0.12/0.42 # Maximum resident set size: 1716 pages
% 0.12/0.42 % E---3.1 exiting
% 0.12/0.43 % E exiting
%------------------------------------------------------------------------------