TSTP Solution File: COM003-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : COM003-2 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 17:20:52 EDT 2023
% Result : Unsatisfiable 0.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 7 unt; 0 nHn; 17 RR)
% Number of literals : 39 ( 0 equ; 21 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 48 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(program_halts2_halts3_outputs1,axiom,
( program_halts2(X2,X3)
| ~ program_halts2_halts3_outputs(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.fipRbfLhGR/E---3.1_16946.p',program_halts2_halts3_outputs1) ).
cnf(axiom2_1,hypothesis,
( program_halts2_halts3_outputs(X1,X2,X3,good)
| ~ program_program_decides(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fipRbfLhGR/E---3.1_16946.p',axiom2_1) ).
cnf(axiom1_1,hypothesis,
( program_program_decides(c1)
| ~ algorithm_program_decides(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fipRbfLhGR/E---3.1_16946.p',axiom1_1) ).
cnf(prove_algorithm_does_not_exist,negated_conjecture,
algorithm_program_decides(c4),
file('/export/starexec/sandbox2/tmp/tmp.fipRbfLhGR/E---3.1_16946.p',prove_algorithm_does_not_exist) ).
cnf(program_not_halts3a,axiom,
( ~ program_not_halts2(X1,X2)
| ~ halts2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.fipRbfLhGR/E---3.1_16946.p',program_not_halts3a) ).
cnf(program_halts3a,axiom,
( halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.fipRbfLhGR/E---3.1_16946.p',program_halts3a) ).
cnf(program_not_halts2_halts3_outputs1,axiom,
( program_not_halts2(X2,X3)
| ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.fipRbfLhGR/E---3.1_16946.p',program_not_halts2_halts3_outputs1) ).
cnf(axiom2_2,hypothesis,
( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
| ~ program_program_decides(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fipRbfLhGR/E---3.1_16946.p',axiom2_2) ).
cnf(c_0_8,axiom,
( program_halts2(X2,X3)
| ~ program_halts2_halts3_outputs(X1,X2,X3,X4) ),
program_halts2_halts3_outputs1 ).
cnf(c_0_9,hypothesis,
( program_halts2_halts3_outputs(X1,X2,X3,good)
| ~ program_program_decides(X1) ),
axiom2_1 ).
cnf(c_0_10,hypothesis,
( program_program_decides(c1)
| ~ algorithm_program_decides(X1) ),
axiom1_1 ).
cnf(c_0_11,negated_conjecture,
algorithm_program_decides(c4),
prove_algorithm_does_not_exist ).
cnf(c_0_12,axiom,
( ~ program_not_halts2(X1,X2)
| ~ halts2(X1,X2) ),
program_not_halts3a ).
cnf(c_0_13,axiom,
( halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
program_halts3a ).
cnf(c_0_14,hypothesis,
( program_halts2(X1,X2)
| ~ program_program_decides(X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
program_program_decides(c1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ program_not_halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
program_halts2(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( program_not_halts2(X2,X3)
| ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4) ),
program_not_halts2_halts3_outputs1 ).
cnf(c_0_19,hypothesis,
( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
| ~ program_program_decides(X1) ),
axiom2_2 ).
cnf(c_0_20,plain,
~ program_not_halts2(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,hypothesis,
~ program_program_decides(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : COM003-2 : TPTP v8.1.2. Released v1.1.0.
% 0.13/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n027.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Oct 3 05:22:31 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.fipRbfLhGR/E---3.1_16946.p
% 0.23/0.54 # Version: 3.1pre001
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # sh5l with pid 17027 completed with status 0
% 0.23/0.54 # Result found by sh5l
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.54 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.23/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 163s (1) cores
% 0.23/0.54 # G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with pid 17031 completed with status 0
% 0.23/0.54 # Result found by G-E--_208_C47_F1_SE_CS_SP_PS_S0Y
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.54 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.23/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 163s (1) cores
% 0.23/0.54 # Preprocessing time : 0.001 s
% 0.23/0.54 # Presaturation interreduction done
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Unsatisfiable
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 43
% 0.23/0.54 # Removed by relevancy pruning/SinE : 1
% 0.23/0.54 # Initial clauses : 42
% 0.23/0.54 # Removed in clause preprocessing : 0
% 0.23/0.54 # Initial clauses in saturation : 42
% 0.23/0.54 # Processed clauses : 80
% 0.23/0.54 # ...of these trivial : 2
% 0.23/0.54 # ...subsumed : 0
% 0.23/0.54 # ...remaining for further processing : 78
% 0.23/0.54 # Other redundant clauses eliminated : 0
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 6
% 0.23/0.54 # Backward-rewritten : 12
% 0.23/0.54 # Generated clauses : 15
% 0.23/0.54 # ...of the previous two non-redundant : 12
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 0
% 0.23/0.54 # Paramodulations : 14
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 0
% 0.23/0.54 # Total rewrite steps : 15
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 17
% 0.23/0.54 # Positive orientable unit clauses : 5
% 0.23/0.54 # Positive unorientable unit clauses: 0
% 0.23/0.54 # Negative unit clauses : 3
% 0.23/0.54 # Non-unit-clauses : 9
% 0.23/0.54 # Current number of unprocessed clauses: 16
% 0.23/0.54 # ...number of literals in the above : 53
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 61
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 836
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 537
% 0.23/0.54 # Non-unit clause-clause subsumptions : 0
% 0.23/0.54 # Unit Clause-clause subsumption calls : 19
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 6
% 0.23/0.54 # BW rewrite match successes : 6
% 0.23/0.54 # Condensation attempts : 0
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 1303
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.004 s
% 0.23/0.54 # System time : 0.001 s
% 0.23/0.54 # Total time : 0.006 s
% 0.23/0.54 # Maximum resident set size: 1788 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.005 s
% 0.23/0.54 # System time : 0.004 s
% 0.23/0.54 # Total time : 0.010 s
% 0.23/0.54 # Maximum resident set size: 1704 pages
% 0.23/0.54 % E---3.1 exiting
% 0.23/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------