TSTP Solution File: COM003+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM003+2 : TPTP v8.1.0. Bugfixed v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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 : 600s
% DateTime : Fri Jul 15 01:43:24 EDT 2022
% Result : Theorem 0.20s 0.57s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM003+2 : TPTP v8.1.0. Bugfixed v2.2.0.
% 0.13/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n022.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 : 600
% 0.14/0.34 % DateTime : Thu Jun 16 20:11:47 EDT 2022
% 0.20/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox2 on n022.cluster.edu,
% 0.20/0.36 Thu Jun 16 20:11:47 2022
% 0.20/0.36 The command was "./sos". The process ID is 22079.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 formula_list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.20/0.36
% 0.20/0.36 This is a non-Horn set without equality. The strategy
% 0.20/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.20/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.56
% 0.20/0.56 Stopped by limit on insertions
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Failed to model usable list: disabling FINDER
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 -------------- Softie stats --------------
% 0.20/0.56
% 0.20/0.56 UPDATE_STOP: 300
% 0.20/0.56 SFINDER_TIME_LIMIT: 2
% 0.20/0.56 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.56 number of clauses in intial UL: 37
% 0.20/0.56 number of clauses initially in problem: 43
% 0.20/0.56 percentage of clauses intially in UL: 86
% 0.20/0.56 percentage of distinct symbols occuring in initial UL: 96
% 0.20/0.56 percent of all initial clauses that are short: 100
% 0.20/0.56 absolute distinct symbol count: 27
% 0.20/0.56 distinct predicate count: 17
% 0.20/0.56 distinct function count: 4
% 0.20/0.56 distinct constant count: 6
% 0.20/0.56
% 0.20/0.56 ---------- no more Softie stats ----------
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 =========== start of search ===========
% 0.20/0.57
% 0.20/0.57 -------- PROOF --------
% 0.20/0.57 % SZS status Theorem
% 0.20/0.57 % SZS output start Refutation
% 0.20/0.57
% 0.20/0.57 -----> EMPTY CLAUSE at 0.18 sec ----> 233 [hyper,222,36,61,60,59,218] {-} $F.
% 0.20/0.57
% 0.20/0.57 Length of proof is 15. Level of proof is 10.
% 0.20/0.57
% 0.20/0.57 ---------------- PROOF ----------------
% 0.20/0.57 % SZS status Theorem
% 0.20/0.57 % SZS output start Refutation
% 0.20/0.57
% 0.20/0.57 3 [] {+} -program_program_decides(A)|program(A).
% 0.20/0.57 11 [] {+} program_halts2(A,B)| -program(A)| -halts2(A,B).
% 0.20/0.57 17 [] {+} program_not_halts2(A,B)| -program(A)|halts2(A,B).
% 0.20/0.57 18 [] {+} -halts2_outputs(A,B,C)|halts2(A,B).
% 0.20/0.57 27 [] {+} -program_not_halts2_halts2_outputs(A,B,C)| -program_not_halts2(B,B)|halts2_outputs(A,B,C).
% 0.20/0.57 29 [] {+} -algorithm_program_decides(A)|program_program_decides($c1).
% 0.20/0.57 30 [] {+} -program_program_decides(A)|program_halts2_halts3_outputs(A,B,C,good).
% 0.20/0.57 31 [] {+} -program_program_decides(A)|program_not_halts2_halts3_outputs(A,B,C,bad).
% 0.20/0.57 32 [] {+} -program(A)| -program_halts2_halts3_outputs(A,$f3(A),$f3(A),good)| -program_not_halts2_halts3_outputs(A,$f3(A),$f3(A),bad)|program($c2).
% 0.20/0.57 33 [] {+} -program(A)| -program_halts2_halts3_outputs(A,$f3(A),$f3(A),good)| -program_not_halts2_halts3_outputs(A,$f3(A),$f3(A),bad)|program_halts2_halts2_outputs($c2,B,good).
% 0.20/0.57 34 [] {+} -program(A)| -program_halts2_halts3_outputs(A,$f3(A),$f3(A),good)| -program_not_halts2_halts3_outputs(A,$f3(A),$f3(A),bad)|program_not_halts2_halts2_outputs($c2,B,bad).
% 0.20/0.57 35 [] {+} -program(A)| -program_halts2_halts2_outputs(A,$f4(A),good)| -program_not_halts2_halts2_outputs(A,$f4(A),bad)|program($c3).
% 0.20/0.57 36 [] {+} -program(A)| -program_halts2_halts2_outputs(A,$f4(A),good)| -program_not_halts2_halts2_outputs(A,$f4(A),bad)| -program_halts2(B,B)| -halts2($c3,B).
% 0.20/0.57 37 [] {+} -program(A)| -program_halts2_halts2_outputs(A,$f4(A),good)| -program_not_halts2_halts2_outputs(A,$f4(A),bad)|program_not_halts2_halts2_outputs($c3,B,good).
% 0.20/0.57 43 [] {-} algorithm_program_decides($c4).
% 0.20/0.57 44 [hyper,43,29] {-} program_program_decides($c1).
% 0.20/0.57 47 [hyper,44,31] {-} program_not_halts2_halts3_outputs($c1,A,B,bad).
% 0.20/0.57 48 [hyper,44,30] {-} program_halts2_halts3_outputs($c1,A,B,good).
% 0.20/0.57 50 [hyper,44,3] {-} program($c1).
% 0.20/0.57 59 [hyper,48,34,50,47] {-} program_not_halts2_halts2_outputs($c2,A,bad).
% 0.20/0.57 60 [hyper,48,33,50,47] {-} program_halts2_halts2_outputs($c2,A,good).
% 0.20/0.57 61 [hyper,48,32,50,47] {-} program($c2).
% 0.20/0.57 72 [hyper,60,37,61,59] {-} program_not_halts2_halts2_outputs($c3,A,good).
% 0.20/0.57 73 [hyper,60,35,61,59] {-} program($c3).
% 0.20/0.57 76 [hyper,73,17] {-} program_not_halts2($c3,A)|halts2($c3,A).
% 0.20/0.57 114 [hyper,76,27,72] {-} halts2($c3,$c3)|halts2_outputs($c3,$c3,good).
% 0.20/0.57 168 [hyper,114,11,73] {-} halts2_outputs($c3,$c3,good)|program_halts2($c3,$c3).
% 0.20/0.57 216 [hyper,168,36,61,60,59,114,factor_simp] {-} halts2_outputs($c3,$c3,good).
% 0.20/0.57 218 [hyper,216,18] {-} halts2($c3,$c3).
% 0.20/0.57 222 [hyper,218,11,73] {-} program_halts2($c3,$c3).
% 0.20/0.57 233 [hyper,222,36,61,60,59,218] {-} $F.
% 0.20/0.57
% 0.20/0.57 % SZS output end Refutation
% 0.20/0.57 ------------ end of proof -------------
% 0.20/0.57
% 0.20/0.57
% 0.20/0.57 Search stopped by max_proofs option.
% 0.20/0.57
% 0.20/0.57
% 0.20/0.57 Search stopped by max_proofs option.
% 0.20/0.57
% 0.20/0.57 ============ end of search ============
% 0.20/0.57
% 0.20/0.57 That finishes the proof of the theorem.
% 0.20/0.57
% 0.20/0.57 Process 22079 finished Thu Jun 16 20:11:47 2022
%------------------------------------------------------------------------------