TSTP Solution File: LCL182-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL182-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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 : Sun Jul 17 14:28:25 EDT 2022
% Result : Unsatisfiable 4.84s 5.06s
% Output : Refutation 4.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL182-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 4 17:28:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n004.cluster.edu,
% 0.13/0.37 Mon Jul 4 17:28:08 2022
% 0.13/0.37 The command was "./sos". The process ID is 14022.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.37
% 0.13/0.37 This is a Horn set without equality. The strategy will
% 0.13/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.37 in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: clear(order_hyper).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 4
% 0.13/0.40 number of clauses initially in problem: 9
% 0.13/0.40 percentage of clauses intially in UL: 44
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 6
% 0.13/0.40 distinct predicate count: 2
% 0.13/0.40 distinct function count: 2
% 0.13/0.40 distinct constant count: 2
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 4.84/5.06
% 4.84/5.06 -------- PROOF --------
% 4.84/5.06 % SZS status Unsatisfiable
% 4.84/5.06 % SZS output start Refutation
% 4.84/5.06
% 4.84/5.06 Model 3 (0.00 seconds, 0 Inserts)
% 4.84/5.06
% 4.84/5.06 Stopped by limit on number of solutions
% 4.84/5.06
% 4.84/5.06 Model 4 (0.00 seconds, 0 Inserts)
% 4.84/5.06
% 4.84/5.06 Stopped by limit on number of solutions
% 4.84/5.06
% 4.84/5.06 Stopped by limit on insertions
% 4.84/5.06
% 4.84/5.06 Model 5 [ 1 3 10246 ] (0.00 seconds, 250000 Inserts)
% 4.84/5.06
% 4.84/5.06 Stopped by limit on insertions
% 4.84/5.06
% 4.84/5.06 Model 6 [ 1 1 2083 ] (0.00 seconds, 250000 Inserts)
% 4.84/5.06
% 4.84/5.06 Stopped by limit on insertions
% 4.84/5.06
% 4.84/5.06 Model 7 [ 2 1 2935 ] (0.00 seconds, 250000 Inserts)
% 4.84/5.06
% 4.84/5.06 Stopped by limit on insertions
% 4.84/5.06
% 4.84/5.06 Model 8 [ 2 19 149728 ] (0.00 seconds, 250000 Inserts)
% 4.84/5.06
% 4.84/5.06 Stopped by limit on insertions
% 4.84/5.06
% 4.84/5.06 Model 9 [ 2 4 21179 ] (0.00 seconds, 250000 Inserts)
% 4.84/5.06
% 4.84/5.06 ----> UNIT CONFLICT at 4.67 sec ----> 1328 [binary,1327.1,4.1] {-} $F.
% 4.84/5.06
% 4.84/5.06 Length of proof is 6. Level of proof is 6.
% 4.84/5.06
% 4.84/5.06 ---------------- PROOF ----------------
% 4.84/5.06 % SZS status Unsatisfiable
% 4.84/5.06 % SZS output start Refutation
% 4.84/5.06
% 4.84/5.06 1 [] {+} theorem(A)| -axiom(A).
% 4.84/5.06 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 4.84/5.06 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 4.84/5.06 4 [] {+} -theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))).
% 4.84/5.06 5 [] {+} axiom(or(not(or(A,A)),A)).
% 4.84/5.06 6 [] {+} axiom(or(not(A),or(B,A))).
% 4.84/5.06 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 4.84/5.06 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 4.84/5.06 9 [] {+} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 4.84/5.06 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 4.84/5.06 54 [hyper,9,2,10] {-} theorem(or(not(or(A,or(B,B))),or(A,B))).
% 4.84/5.06 111 [hyper,54,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))).
% 4.84/5.06 639 [hyper,111,3,7] {-} theorem(or(not(or(A,not(B))),or(not(or(A,B)),A))).
% 4.84/5.06 1319 [hyper,639,3,6] {-} theorem(or(not(not(A)),or(not(or(B,A)),B))).
% 4.84/5.06 1327 [hyper,1319,2,8] {-} theorem(or(not(or(A,B)),or(not(not(B)),A))).
% 4.84/5.06 1328 [binary,1327.1,4.1] {-} $F.
% 4.84/5.06
% 4.84/5.06 % SZS output end Refutation
% 4.84/5.06 ------------ end of proof -------------
% 4.84/5.06
% 4.84/5.06
% 4.84/5.06 Search stopped by max_proofs option.
% 4.84/5.06
% 4.84/5.06
% 4.84/5.06 Search stopped by max_proofs option.
% 4.84/5.06
% 4.84/5.06 ============ end of search ============
% 4.84/5.06
% 4.84/5.06 ----------- soft-scott stats ----------
% 4.84/5.06
% 4.84/5.06 true clauses given 82 (31.5%)
% 4.84/5.06 false clauses given 178
% 4.84/5.06
% 4.84/5.06 FALSE TRUE
% 4.84/5.06 9 0 15
% 4.84/5.06 11 0 114
% 4.84/5.06 13 73 117
% 4.84/5.06 14 7 2
% 4.84/5.06 15 170 40
% 4.84/5.06 16 10 6
% 4.84/5.06 17 113 38
% 4.84/5.06 18 22 3
% 4.84/5.06 19 57 30
% 4.84/5.06 20 18 3
% 4.84/5.06 21 37 17
% 4.84/5.06 22 9 2
% 4.84/5.06 23 20 4
% 4.84/5.06 24 0 5
% 4.84/5.06 25 10 0
% 4.84/5.06 26 5 2
% 4.84/5.06 27 4 1
% 4.84/5.06 28 6 0
% 4.84/5.06 29 1 5
% 4.84/5.06 30 1 0
% 4.84/5.06 31 3 2
% 4.84/5.06 32 1 0
% 4.84/5.06 33 4 1
% 4.84/5.06 34 1 0
% 4.84/5.06 35 1 1
% 4.84/5.06 36 1 1
% 4.84/5.06 37 2 2
% 4.84/5.06 46 1 0
% 4.84/5.06 47 0 1
% 4.84/5.06 57 1 0
% 4.84/5.06 tot: 578 412 (41.6% true)
% 4.84/5.06
% 4.84/5.06
% 4.84/5.06 Model 9 [ 2 4 21179 ] (0.00 seconds, 250000 Inserts)
% 4.84/5.06
% 4.84/5.06 That finishes the proof of the theorem.
% 4.84/5.07
% 4.84/5.07 Process 14022 finished Mon Jul 4 17:28:12 2022
%------------------------------------------------------------------------------