TSTP Solution File: COM003-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COM003-2 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:08:02 EDT 2024
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 30 ( 7 unt; 0 nHn; 22 RR)
% Number of literals : 53 ( 0 equ; 29 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 : 67 ( 35 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(program_halts2_halts3_outputs1,axiom,
( program_halts2(X2,X3)
| ~ program_halts2_halts3_outputs(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_halts2_halts3_outputs1) ).
cnf(axiom2_1,hypothesis,
( program_halts2_halts3_outputs(X1,X2,X3,good)
| ~ program_program_decides(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom2_1) ).
cnf(axiom1_1,hypothesis,
( program_program_decides(c1)
| ~ algorithm_program_decides(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1_1) ).
cnf(program_not_halts3a,axiom,
( ~ program_not_halts2(X1,X2)
| ~ halts2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_not_halts3a) ).
cnf(program_halts3a,axiom,
( halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',program_halts3a) ).
cnf(prove_algorithm_does_not_exist,negated_conjecture,
algorithm_program_decides(c4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_algorithm_does_not_exist) ).
cnf(program_not_halts2_halts3_outputs1,axiom,
( program_not_halts2(X2,X3)
| ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/theBenchmark.p',axiom2_2) ).
cnf(c_0_8,plain,
( program_halts2(X2,X3)
| ~ program_halts2_halts3_outputs(X1,X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[program_halts2_halts3_outputs1]) ).
cnf(c_0_9,hypothesis,
( program_halts2_halts3_outputs(X1,X2,X3,good)
| ~ program_program_decides(X1) ),
inference(fof_simplification,[status(thm)],[axiom2_1]) ).
cnf(c_0_10,hypothesis,
( program_program_decides(c1)
| ~ algorithm_program_decides(X1) ),
inference(fof_simplification,[status(thm)],[axiom1_1]) ).
cnf(c_0_11,plain,
( ~ program_not_halts2(X1,X2)
| ~ halts2(X1,X2) ),
inference(fof_simplification,[status(thm)],[program_not_halts3a]) ).
cnf(c_0_12,plain,
( halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
inference(fof_simplification,[status(thm)],[program_halts3a]) ).
cnf(c_0_13,plain,
( program_halts2(X2,X3)
| ~ program_halts2_halts3_outputs(X1,X2,X3,X4) ),
c_0_8 ).
cnf(c_0_14,hypothesis,
( program_halts2_halts3_outputs(X1,X2,X3,good)
| ~ program_program_decides(X1) ),
c_0_9 ).
cnf(c_0_15,hypothesis,
( program_program_decides(c1)
| ~ algorithm_program_decides(X1) ),
c_0_10 ).
cnf(c_0_16,negated_conjecture,
algorithm_program_decides(c4),
prove_algorithm_does_not_exist ).
cnf(c_0_17,plain,
( ~ program_not_halts2(X1,X2)
| ~ halts2(X1,X2) ),
c_0_11 ).
cnf(c_0_18,plain,
( halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
c_0_12 ).
cnf(c_0_19,hypothesis,
( program_halts2(X1,X2)
| ~ program_program_decides(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
program_program_decides(c1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( program_not_halts2(X2,X3)
| ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[program_not_halts2_halts3_outputs1]) ).
cnf(c_0_22,hypothesis,
( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
| ~ program_program_decides(X1) ),
inference(fof_simplification,[status(thm)],[axiom2_2]) ).
cnf(c_0_23,plain,
( ~ program_not_halts2(X1,X2)
| ~ program_halts2(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
program_halts2(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( program_not_halts2(X2,X3)
| ~ program_not_halts2_halts3_outputs(X1,X2,X3,X4) ),
c_0_21 ).
cnf(c_0_26,hypothesis,
( program_not_halts2_halts3_outputs(X1,X2,X3,bad)
| ~ program_program_decides(X1) ),
c_0_22 ).
cnf(c_0_27,plain,
~ program_not_halts2(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_28,hypothesis,
~ program_program_decides(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM003-2 : TPTP v8.2.0. Released v1.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 10:16:52 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # new_bool_3 with pid 26520 completed with status 0
% 0.20/0.48 # Result found by new_bool_3
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.20/0.48 # G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with pid 26525 completed with status 0
% 0.20/0.48 # Result found by G-E--_208_C47_F1_SE_CS_SP_PS_S0Y
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FGHNF-FFMF11-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting G-E--_208_C47_F1_SE_CS_SP_PS_S0Y with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Unsatisfiable
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 43
% 0.20/0.48 # Removed by relevancy pruning/SinE : 10
% 0.20/0.48 # Initial clauses : 33
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 33
% 0.20/0.48 # Processed clauses : 69
% 0.20/0.48 # ...of these trivial : 1
% 0.20/0.48 # ...subsumed : 1
% 0.20/0.48 # ...remaining for further processing : 67
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 6
% 0.20/0.48 # Backward-rewritten : 11
% 0.20/0.48 # Generated clauses : 15
% 0.20/0.48 # ...of the previous two non-redundant : 13
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 14
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 13
% 0.20/0.48 # ...of those cached : 7
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 16
% 0.20/0.48 # Positive orientable unit clauses : 5
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 2
% 0.20/0.48 # Non-unit-clauses : 9
% 0.20/0.48 # Current number of unprocessed clauses: 10
% 0.20/0.48 # ...number of literals in the above : 36
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 51
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 360
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 208
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 11
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 5
% 0.20/0.48 # BW rewrite match successes : 5
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 1421
% 0.20/0.48 # Search garbage collected termcells : 113
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.007 s
% 0.20/0.48 # System time : 0.000 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1756 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.008 s
% 0.20/0.48 # System time : 0.003 s
% 0.20/0.48 # Total time : 0.011 s
% 0.20/0.48 # Maximum resident set size: 1756 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------