TSTP Solution File: COM003-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM003-2 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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 : Unsatisfiable 2.52s 2.70s
% Output : Refutation 2.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM003-2 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 18:04:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n020.cluster.edu,
% 0.13/0.36 Thu Jun 16 18:04:49 2022
% 0.13/0.36 The command was "./sos". The process ID is 9727.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 41
% 0.19/0.39 number of clauses initially in problem: 43
% 0.19/0.39 percentage of clauses intially in UL: 95
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 96
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 27
% 0.19/0.39 distinct predicate count: 17
% 0.19/0.39 distinct function count: 4
% 0.19/0.39 distinct constant count: 6
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 2.52/2.70
% 2.52/2.70 -------- PROOF --------
% 2.52/2.70 % SZS status Unsatisfiable
% 2.52/2.70 % SZS output start Refutation
% 2.52/2.70
% 2.52/2.70 Model 2 [ 2 1 673 ] (0.00 seconds, 24012 Inserts)
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70 Model 3 [ 3 1 477 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70 Model 4 [ 4 2 5086 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70 Model 5 [ 10 1 509 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70 Model 6 [ 13 0 526 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70 Model 7 [ 7 1 2905 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70 Model 8 [ 18 1 521 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70 Model 9 [ 22 1 9708 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70 Model 10 [ 20 1 7256 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70 Model 11 [ 31 1 2401 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70 Model 12 [ 36 0 672 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70 Model 13 [ 44 0 686 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 -----> EMPTY CLAUSE at 2.31 sec ----> 70 [hyper,66,16,52] {-} $F.
% 2.52/2.70
% 2.52/2.70 Length of proof is 6. Level of proof is 4.
% 2.52/2.70
% 2.52/2.70 ---------------- PROOF ----------------
% 2.52/2.70 % SZS status Unsatisfiable
% 2.52/2.70 % SZS output start Refutation
% 2.52/2.70
% 2.52/2.70 10 [] {+} -program_halts2(A,B)|halts2(A,B).
% 2.52/2.70 16 [] {+} -program_not_halts2(A,B)| -halts2(A,B).
% 2.52/2.70 21 [] {+} -program_halts2_halts3_outputs(A,B,C,D)|program_halts2(B,C).
% 2.52/2.70 24 [] {+} -program_not_halts2_halts3_outputs(A,B,C,D)|program_not_halts2(B,C).
% 2.52/2.70 33 [] {+} -algorithm_program_decides(A)|program_program_decides(c1).
% 2.52/2.70 34 [] {+} -program_program_decides(A)|program_halts2_halts3_outputs(A,B,C,good).
% 2.52/2.70 35 [] {+} -program_program_decides(A)|program_not_halts2_halts3_outputs(A,B,C,bad).
% 2.52/2.70 43 [] {-} algorithm_program_decides(c4).
% 2.52/2.70 44 [hyper,43,33] {-} program_program_decides(c1).
% 2.52/2.70 47 [hyper,44,35] {+} program_not_halts2_halts3_outputs(c1,A,B,bad).
% 2.52/2.70 48 [hyper,44,34] {+} program_halts2_halts3_outputs(c1,A,B,good).
% 2.52/2.70 52 [hyper,47,24] {+} program_not_halts2(A,B).
% 2.52/2.70 58 [hyper,48,21] {+} program_halts2(A,B).
% 2.52/2.70 66 [hyper,58,10] {+} halts2(A,B).
% 2.52/2.70 70 [hyper,66,16,52] {-} $F.
% 2.52/2.70
% 2.52/2.70 % SZS output end Refutation
% 2.52/2.70 ------------ end of proof -------------
% 2.52/2.70
% 2.52/2.70
% 2.52/2.70 Search stopped by max_proofs option.
% 2.52/2.70
% 2.52/2.70
% 2.52/2.70 Search stopped by max_proofs option.
% 2.52/2.70
% 2.52/2.70 ============ end of search ============
% 2.52/2.70
% 2.52/2.70 ----------- soft-scott stats ----------
% 2.52/2.70
% 2.52/2.70 true clauses given 2 (11.8%)
% 2.52/2.70 false clauses given 15
% 2.52/2.70
% 2.52/2.70 FALSE TRUE
% 2.52/2.70 3 0 1
% 2.52/2.70 4 5 0
% 2.52/2.70 5 4 0
% 2.52/2.70 tot: 9 1 (10.0% true)
% 2.52/2.70
% 2.52/2.70
% 2.52/2.70 Model 13 [ 44 0 686 ] (0.00 seconds, 250000 Inserts)
% 2.52/2.70
% 2.52/2.70 That finishes the proof of the theorem.
% 2.52/2.70
% 2.52/2.70 Process 9727 finished Thu Jun 16 18:04:51 2022
%------------------------------------------------------------------------------