TSTP Solution File: LCL207-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL207-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:40 EDT 2022
% Result : Unsatisfiable 5.27s 5.46s
% Output : Refutation 5.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : LCL207-1 : TPTP v8.1.0. Released v1.1.0.
% 0.15/0.15 % Command : sos-script %s
% 0.15/0.37 % Computer : n021.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Mon Jul 4 08:47:01 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.15/0.39 ----- Otter 3.2, August 2001 -----
% 0.15/0.39 The process was started by sandbox on n021.cluster.edu,
% 0.15/0.39 Mon Jul 4 08:47:01 2022
% 0.15/0.39 The command was "./sos". The process ID is 5904.
% 0.15/0.39
% 0.15/0.39 set(prolog_style_variables).
% 0.15/0.39 set(auto).
% 0.15/0.39 dependent: set(auto1).
% 0.15/0.39 dependent: set(process_input).
% 0.15/0.39 dependent: clear(print_kept).
% 0.15/0.39 dependent: clear(print_new_demod).
% 0.15/0.39 dependent: clear(print_back_demod).
% 0.15/0.39 dependent: clear(print_back_sub).
% 0.15/0.39 dependent: set(control_memory).
% 0.15/0.39 dependent: assign(max_mem, 12000).
% 0.15/0.39 dependent: assign(pick_given_ratio, 4).
% 0.15/0.39 dependent: assign(stats_level, 1).
% 0.15/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.39 dependent: assign(sos_limit, 5000).
% 0.15/0.39 dependent: assign(max_weight, 60).
% 0.15/0.39 clear(print_given).
% 0.15/0.39
% 0.15/0.39 list(usable).
% 0.15/0.39
% 0.15/0.39 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.15/0.39
% 0.15/0.39 This is a Horn set without equality. The strategy will
% 0.15/0.39 be hyperresolution, with satellites in sos and nuclei
% 0.15/0.39 in usable.
% 0.15/0.39
% 0.15/0.39 dependent: set(hyper_res).
% 0.15/0.39 dependent: clear(order_hyper).
% 0.15/0.39
% 0.15/0.39 ------------> process usable:
% 0.15/0.39
% 0.15/0.39 ------------> process sos:
% 0.15/0.39
% 0.15/0.39 ======= end of input processing =======
% 0.15/0.43
% 0.15/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.43
% 0.15/0.43 Stopped by limit on number of solutions
% 0.15/0.43
% 0.15/0.43
% 0.15/0.43 -------------- Softie stats --------------
% 0.15/0.43
% 0.15/0.43 UPDATE_STOP: 300
% 0.15/0.43 SFINDER_TIME_LIMIT: 2
% 0.15/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.43 number of clauses in intial UL: 4
% 0.15/0.43 number of clauses initially in problem: 9
% 0.15/0.43 percentage of clauses intially in UL: 44
% 0.15/0.43 percentage of distinct symbols occuring in initial UL: 100
% 0.15/0.43 percent of all initial clauses that are short: 100
% 0.15/0.43 absolute distinct symbol count: 6
% 0.15/0.43 distinct predicate count: 2
% 0.15/0.43 distinct function count: 2
% 0.15/0.43 distinct constant count: 2
% 0.15/0.43
% 0.15/0.43 ---------- no more Softie stats ----------
% 0.15/0.43
% 0.15/0.43
% 0.15/0.43
% 0.15/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.15/0.43
% 0.15/0.43 Stopped by limit on number of solutions
% 0.15/0.43
% 0.15/0.43 =========== start of search ===========
% 5.27/5.46
% 5.27/5.46 -------- PROOF --------
% 5.27/5.46 % SZS status Unsatisfiable
% 5.27/5.46 % SZS output start Refutation
% 5.27/5.46
% 5.27/5.46 Model 3 (0.00 seconds, 0 Inserts)
% 5.27/5.46
% 5.27/5.46 Stopped by limit on number of solutions
% 5.27/5.46
% 5.27/5.46 Model 4 (0.00 seconds, 0 Inserts)
% 5.27/5.46
% 5.27/5.46 Stopped by limit on number of solutions
% 5.27/5.46
% 5.27/5.46 Stopped by limit on insertions
% 5.27/5.46
% 5.27/5.46 Model 5 [ 1 16 118345 ] (0.00 seconds, 250000 Inserts)
% 5.27/5.46
% 5.27/5.46 Stopped by limit on insertions
% 5.27/5.46
% 5.27/5.46 Model 6 [ 2 0 543 ] (0.00 seconds, 250000 Inserts)
% 5.27/5.46
% 5.27/5.46 Stopped by limit on insertions
% 5.27/5.46
% 5.27/5.46 Model 7 [ 2 2 10979 ] (0.00 seconds, 250000 Inserts)
% 5.27/5.46
% 5.27/5.46 Stopped by limit on insertions
% 5.27/5.46
% 5.27/5.46 Model 8 [ 2 2 7859 ] (0.00 seconds, 250000 Inserts)
% 5.27/5.46
% 5.27/5.46 ----> UNIT CONFLICT at 5.04 sec ----> 197 [binary,196.1,4.1] {-} $F.
% 5.27/5.46
% 5.27/5.46 Length of proof is 5. Level of proof is 5.
% 5.27/5.46
% 5.27/5.46 ---------------- PROOF ----------------
% 5.27/5.46 % SZS status Unsatisfiable
% 5.27/5.46 % SZS output start Refutation
% 5.27/5.46
% 5.27/5.46 1 [] {+} theorem(A)| -axiom(A).
% 5.27/5.46 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 5.27/5.46 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 5.27/5.46 4 [] {+} -theorem(or(not(not(or(not(p),q))),or(not(q),p))).
% 5.27/5.46 6 [] {+} axiom(or(not(A),or(B,A))).
% 5.27/5.46 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 5.27/5.46 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 5.27/5.46 12 [hyper,7,1] {-} theorem(or(not(or(A,B)),or(B,A))).
% 5.27/5.46 14 [hyper,12,3,6] {+} theorem(or(not(A),or(A,B))).
% 5.27/5.46 25 [hyper,8,2,14] {+} theorem(or(A,or(not(A),B))).
% 5.27/5.46 31 [hyper,25,3,6] {-} theorem(or(not(A),or(not(not(or(B,A))),C))).
% 5.27/5.46 196 [hyper,31,2,8] {-} theorem(or(not(not(or(A,B))),or(not(B),C))).
% 5.27/5.46 197 [binary,196.1,4.1] {-} $F.
% 5.27/5.46
% 5.27/5.46 % SZS output end Refutation
% 5.27/5.46 ------------ end of proof -------------
% 5.27/5.46
% 5.27/5.46
% 5.27/5.46 Search stopped by max_proofs option.
% 5.27/5.46
% 5.27/5.46
% 5.27/5.46 Search stopped by max_proofs option.
% 5.27/5.46
% 5.27/5.46 ============ end of search ============
% 5.27/5.46
% 5.27/5.46 ----------- soft-scott stats ----------
% 5.27/5.46
% 5.27/5.46 true clauses given 9 (23.1%)
% 5.27/5.46 false clauses given 30
% 5.27/5.46
% 5.27/5.46 FALSE TRUE
% 5.27/5.46 7 0 3
% 5.27/5.46 9 0 22
% 5.27/5.46 11 26 8
% 5.27/5.46 12 0 1
% 5.27/5.46 13 23 4
% 5.27/5.46 14 1 2
% 5.27/5.46 15 13 5
% 5.27/5.46 16 2 1
% 5.27/5.46 17 6 5
% 5.27/5.46 18 1 0
% 5.27/5.46 19 5 3
% 5.27/5.46 21 5 0
% 5.27/5.46 22 0 1
% 5.27/5.46 24 1 0
% 5.27/5.46 27 0 1
% 5.27/5.46 29 1 0
% 5.27/5.46 tot: 84 56 (40.0% true)
% 5.27/5.46
% 5.27/5.46
% 5.27/5.46 Model 8 [ 2 2 7859 ] (0.00 seconds, 250000 Inserts)
% 5.27/5.46
% 5.27/5.46 That finishes the proof of the theorem.
% 5.27/5.46
% 5.27/5.46 Process 5904 finished Mon Jul 4 08:47:06 2022
%------------------------------------------------------------------------------