TSTP Solution File: PLA006-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PLA006-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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 : Mon Jul 18 17:32:10 EDT 2022
% Result : Unsatisfiable 1.63s 1.85s
% Output : Refutation 1.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : PLA006-1 : TPTP v8.1.0. Released v1.1.0.
% 0.02/0.10 % Command : sos-script %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Tue May 31 23:37:14 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.10/0.31 ----- Otter 3.2, August 2001 -----
% 0.10/0.31 The process was started by sandbox on n032.cluster.edu,
% 0.10/0.31 Tue May 31 23:37:14 2022
% 0.10/0.31 The command was "./sos". The process ID is 12457.
% 0.10/0.31
% 0.10/0.31 set(prolog_style_variables).
% 0.10/0.31 set(auto).
% 0.10/0.31 dependent: set(auto1).
% 0.10/0.31 dependent: set(process_input).
% 0.10/0.31 dependent: clear(print_kept).
% 0.10/0.31 dependent: clear(print_new_demod).
% 0.10/0.31 dependent: clear(print_back_demod).
% 0.10/0.31 dependent: clear(print_back_sub).
% 0.10/0.31 dependent: set(control_memory).
% 0.10/0.31 dependent: assign(max_mem, 12000).
% 0.10/0.31 dependent: assign(pick_given_ratio, 4).
% 0.10/0.31 dependent: assign(stats_level, 1).
% 0.10/0.31 dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.31 dependent: assign(sos_limit, 5000).
% 0.10/0.31 dependent: assign(max_weight, 60).
% 0.10/0.31 clear(print_given).
% 0.10/0.31
% 0.10/0.31 list(usable).
% 0.10/0.31
% 0.10/0.31 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 0.10/0.31
% 0.10/0.31 This is a Horn set without equality. The strategy will
% 0.10/0.31 be hyperresolution, with satellites in sos and nuclei
% 0.10/0.31 in usable.
% 0.10/0.31
% 0.10/0.31 dependent: set(hyper_res).
% 0.10/0.31 dependent: clear(order_hyper).
% 0.10/0.31
% 0.10/0.31 ------------> process usable:
% 0.10/0.31
% 0.10/0.31 ------------> process sos:
% 0.10/0.31
% 0.10/0.31 ======= end of input processing =======
% 0.14/0.33
% 0.14/0.33 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.33
% 0.14/0.33 Stopped by limit on number of solutions
% 0.14/0.33
% 0.14/0.33
% 0.14/0.33 -------------- Softie stats --------------
% 0.14/0.33
% 0.14/0.33 UPDATE_STOP: 300
% 0.14/0.33 SFINDER_TIME_LIMIT: 2
% 0.14/0.33 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.33 number of clauses in intial UL: 12
% 0.14/0.33 number of clauses initially in problem: 31
% 0.14/0.33 percentage of clauses intially in UL: 38
% 0.14/0.33 percentage of distinct symbols occuring in initial UL: 75
% 0.14/0.33 percent of all initial clauses that are short: 96
% 0.14/0.33 absolute distinct symbol count: 16
% 0.14/0.33 distinct predicate count: 2
% 0.14/0.33 distinct function count: 7
% 0.14/0.33 distinct constant count: 7
% 0.14/0.33
% 0.14/0.33 ---------- no more Softie stats ----------
% 0.14/0.33
% 0.14/0.33
% 0.14/0.33
% 0.14/0.33 =========== start of search ===========
% 1.63/1.85
% 1.63/1.85 -------- PROOF --------
% 1.63/1.85 % SZS status Unsatisfiable
% 1.63/1.85 % SZS output start Refutation
% 1.63/1.85
% 1.63/1.85 Model 2 (0.00 seconds, 0 Inserts)
% 1.63/1.85
% 1.63/1.85 Stopped by limit on number of solutions
% 1.63/1.85
% 1.63/1.85 Model 3 (0.00 seconds, 0 Inserts)
% 1.63/1.85
% 1.63/1.85 Stopped by limit on number of solutions
% 1.63/1.85
% 1.63/1.85 Model 4 (0.00 seconds, 0 Inserts)
% 1.63/1.85
% 1.63/1.85 Stopped by limit on number of solutions
% 1.63/1.85
% 1.63/1.85 Model 5 (0.00 seconds, 0 Inserts)
% 1.63/1.85
% 1.63/1.85 Stopped by limit on number of solutions
% 1.63/1.85
% 1.63/1.85 Model 6 (0.00 seconds, 0 Inserts)
% 1.63/1.85
% 1.63/1.85 Stopped by limit on number of solutions
% 1.63/1.85
% 1.63/1.85 Stopped by limit on insertions
% 1.63/1.85
% 1.63/1.85 Stopped by limit on insertions
% 1.63/1.85
% 1.63/1.85 Stopped by limit on insertions
% 1.63/1.85
% 1.63/1.85 Stopped by limit on insertions
% 1.63/1.85
% 1.63/1.85 Stopped by limit on insertions
% 1.63/1.85
% 1.63/1.85 Model 7 [ 3 1 1749 ] (0.00 seconds, 250000 Inserts)
% 1.63/1.85
% 1.63/1.85 Stopped by limit on insertions
% 1.63/1.85
% 1.63/1.85 Model 8 [ 5 1 1344 ] (0.00 seconds, 250000 Inserts)
% 1.63/1.85
% 1.63/1.85 Stopped by limit on insertions
% 1.63/1.85
% 1.63/1.85 Model 9 [ 7 0 911 ] (0.00 seconds, 250000 Inserts)
% 1.63/1.85
% 1.63/1.85 Stopped by limit on insertions
% 1.63/1.85
% 1.63/1.85 Model 10 [ 7 1 2251 ] (0.00 seconds, 250000 Inserts)
% 1.63/1.85
% 1.63/1.85 Stopped by limit on insertions
% 1.63/1.85
% 1.63/1.85 Model 11 [ 7 1 1453 ] (0.00 seconds, 250000 Inserts)
% 1.63/1.85
% 1.63/1.85 ----> UNIT CONFLICT at 1.52 sec ----> 2330 [binary,2329.1,12.1] {-} $F.
% 1.63/1.85
% 1.63/1.85 Length of proof is 2. Level of proof is 2.
% 1.63/1.85
% 1.63/1.85 ---------------- PROOF ----------------
% 1.63/1.85 % SZS status Unsatisfiable
% 1.63/1.85 % SZS output start Refutation
% 1.63/1.85
% 1.63/1.85 2 [] {+} holds(holding(A),do(pickup(A),B))| -holds(empty,B)| -holds(clear(A),B)| -differ(A,table).
% 1.63/1.85 7 [] {+} holds(on(A,B),do(putdown(A,B),C))| -holds(holding(A),C)| -holds(clear(B),C).
% 1.63/1.85 12 [] {+} -holds(on(c,table),A).
% 1.63/1.85 21 [] {+} differ(c,table).
% 1.63/1.85 29 [] {-} holds(clear(c),s0).
% 1.63/1.85 30 [] {+} holds(empty,s0).
% 1.63/1.85 31 [] {-} holds(clear(table),A).
% 1.63/1.85 112 [hyper,21,2,30,29] {+} holds(holding(c),do(pickup(c),s0)).
% 1.63/1.85 2329 [hyper,112,7,31] {-} holds(on(c,table),do(putdown(c,table),do(pickup(c),s0))).
% 1.63/1.85 2330 [binary,2329.1,12.1] {-} $F.
% 1.63/1.85
% 1.63/1.85 % SZS output end Refutation
% 1.63/1.85 ------------ end of proof -------------
% 1.63/1.85
% 1.63/1.85
% 1.63/1.85 Search stopped by max_proofs option.
% 1.63/1.85
% 1.63/1.85
% 1.63/1.85 Search stopped by max_proofs option.
% 1.63/1.85
% 1.63/1.85 ============ end of search ============
% 1.63/1.85
% 1.63/1.85 ----------- soft-scott stats ----------
% 1.63/1.85
% 1.63/1.85 true clauses given 21 (23.6%)
% 1.63/1.85 false clauses given 68
% 1.63/1.85
% 1.63/1.85 FALSE TRUE
% 1.63/1.85 7 0 5
% 1.63/1.85 8 55 16
% 1.63/1.85 9 91 43
% 1.63/1.85 10 321 68
% 1.63/1.85 11 376 66
% 1.63/1.85 12 341 97
% 1.63/1.85 13 488 49
% 1.63/1.85 14 180 6
% 1.63/1.85 15 18 0
% 1.63/1.85 tot: 1870 350 (15.8% true)
% 1.63/1.85
% 1.63/1.85
% 1.63/1.85 Model 11 [ 7 1 1453 ] (0.00 seconds, 250000 Inserts)
% 1.63/1.85
% 1.63/1.85 That finishes the proof of the theorem.
% 1.63/1.85
% 1.63/1.85 Process 12457 finished Tue May 31 23:37:15 2022
%------------------------------------------------------------------------------