TSTP Solution File: COM002-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM002-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:23 EDT 2022
% Result : Unsatisfiable 0.88s 1.07s
% Output : Refutation 0.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n011.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 19:47:51 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox2 on n011.cluster.edu,
% 0.14/0.36 Thu Jun 16 19:47:51 2022
% 0.14/0.36 The command was "./sos". The process ID is 23245.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.14/0.36
% 0.14/0.36 This is a non-Horn set without equality. The strategy
% 0.14/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.14/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 4
% 0.20/0.38 number of clauses initially in problem: 19
% 0.20/0.38 percentage of clauses intially in UL: 21
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 23
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 26
% 0.20/0.38 distinct predicate count: 4
% 0.20/0.38 distinct function count: 6
% 0.20/0.38 distinct constant count: 16
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 0.88/1.07
% 0.88/1.07 -------- PROOF --------
% 0.88/1.07 % SZS status Unsatisfiable
% 0.88/1.07 % SZS output start Refutation
% 0.88/1.07
% 0.88/1.07 Model 2 (0.00 seconds, 0 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on number of solutions
% 0.88/1.07
% 0.88/1.07 Model 3 (0.00 seconds, 0 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on number of solutions
% 0.88/1.07
% 0.88/1.07 Model 4 (0.00 seconds, 0 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on number of solutions
% 0.88/1.07
% 0.88/1.07 Stopped by limit on insertions
% 0.88/1.07
% 0.88/1.07 Model 5 [ 1 1 128 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Model 6 (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on number of solutions
% 0.88/1.07
% 0.88/1.07 Stopped by limit on insertions
% 0.88/1.07
% 0.88/1.07 Model 7 [ 2 0 2024 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Model 8 (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on number of solutions
% 0.88/1.07
% 0.88/1.07 Stopped by limit on insertions
% 0.88/1.07
% 0.88/1.07 Model 9 [ 1 0 202 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on insertions
% 0.88/1.07
% 0.88/1.07 Model 10 [ 2 1 17887 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on insertions
% 0.88/1.07
% 0.88/1.07 Model 11 [ 1 1 129 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on insertions
% 0.88/1.07
% 0.88/1.07 Model 12 [ 2 0 280 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on insertions
% 0.88/1.07
% 0.88/1.07 Model 13 [ 6 1 1308 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on insertions
% 0.88/1.07
% 0.88/1.07 Model 14 [ 5 0 121 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on insertions
% 0.88/1.07
% 0.88/1.07 Model 15 [ 4 0 120 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on insertions
% 0.88/1.07
% 0.88/1.07 Model 16 [ 5 1 574 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 Stopped by limit on insertions
% 0.88/1.07
% 0.88/1.07 Model 17 [ 6 1 40824 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 -----> EMPTY CLAUSE at 0.68 sec ----> 64 [hyper,62,1,17] {-} $F.
% 0.88/1.07
% 0.88/1.07 Length of proof is 6. Level of proof is 6.
% 0.88/1.07
% 0.88/1.07 ---------------- PROOF ----------------
% 0.88/1.07 % SZS status Unsatisfiable
% 0.88/1.07 % SZS output start Refutation
% 0.88/1.07
% 0.88/1.07 1 [] {+} -fails(A,B)| -follows(A,B).
% 0.88/1.07 2 [] {+} -fails(A,B)|fails(A,C)|fails(C,B).
% 0.88/1.07 3 [] {+} -fails(A,B)| -has(B,goto(C))| -labels(C,A).
% 0.88/1.07 8 [] {+} labels(loop,p3).
% 0.88/1.07 13 [] {+} follows(p6,p3).
% 0.88/1.07 15 [] {+} follows(p7,p6).
% 0.88/1.07 17 [] {+} follows(p8,p7).
% 0.88/1.07 18 [] {+} has(p8,goto(loop)).
% 0.88/1.07 19 [] {+} fails(p3,p3).
% 0.88/1.07 20 [hyper,19,2] {+} fails(p3,A)|fails(A,p3).
% 0.88/1.07 21 [hyper,20,3,18,8] {+} fails(p8,p3).
% 0.88/1.07 27 [hyper,21,2] {+} fails(p8,A)|fails(A,p3).
% 0.88/1.07 39 [hyper,27,1,13] {+} fails(p8,p6).
% 0.88/1.07 44 [hyper,39,2] {+} fails(p8,A)|fails(A,p6).
% 0.88/1.07 62 [hyper,44,1,15] {+} fails(p8,p7).
% 0.88/1.07 64 [hyper,62,1,17] {-} $F.
% 0.88/1.07
% 0.88/1.07 % SZS output end Refutation
% 0.88/1.07 ------------ end of proof -------------
% 0.88/1.07
% 0.88/1.07
% 0.88/1.07 Search stopped by max_proofs option.
% 0.88/1.07
% 0.88/1.07
% 0.88/1.07 Search stopped by max_proofs option.
% 0.88/1.07
% 0.88/1.07 ============ end of search ============
% 0.88/1.07
% 0.88/1.07 ----------- soft-scott stats ----------
% 0.88/1.07
% 0.88/1.07 true clauses given 20 (51.3%)
% 0.88/1.07 false clauses given 19
% 0.88/1.07
% 0.88/1.07 FALSE TRUE
% 0.88/1.07 3 1 0
% 0.88/1.07 6 1 8
% 0.88/1.07 9 1 4
% 0.88/1.07 12 0 2
% 0.88/1.07 tot: 3 14 (82.4% true)
% 0.88/1.07
% 0.88/1.07
% 0.88/1.07 Model 17 [ 6 1 40824 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.07
% 0.88/1.07 That finishes the proof of the theorem.
% 0.88/1.07
% 0.88/1.07 Process 23245 finished Thu Jun 16 19:47:52 2022
%------------------------------------------------------------------------------