TSTP Solution File: LCL203-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL203-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:38 EDT 2022
% Result : Unsatisfiable 9.05s 9.23s
% Output : Refutation 9.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL203-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n005.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 : Mon Jul 4 22:03:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n005.cluster.edu,
% 0.13/0.35 Mon Jul 4 22:03:07 2022
% 0.13/0.35 The command was "./sos". The process ID is 3224.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set without equality. The strategy will
% 0.13/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35 in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35
% 0.13/0.35 ======= 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 ===========
% 9.05/9.23
% 9.05/9.23 -------- PROOF --------
% 9.05/9.23 % SZS status Unsatisfiable
% 9.05/9.23 % SZS output start Refutation
% 9.05/9.23
% 9.05/9.23 Model 3 (0.00 seconds, 0 Inserts)
% 9.05/9.23
% 9.05/9.23 Stopped by limit on number of solutions
% 9.05/9.23
% 9.05/9.23 Stopped by limit on insertions
% 9.05/9.23
% 9.05/9.23 Model 4 [ 12 3 8568 ] (0.00 seconds, 250000 Inserts)
% 9.05/9.23
% 9.05/9.23 Stopped by limit on insertions
% 9.05/9.23
% 9.05/9.23 Model 5 [ 1 1 727 ] (0.00 seconds, 250000 Inserts)
% 9.05/9.23
% 9.05/9.23 Stopped by limit on insertions
% 9.05/9.23
% 9.05/9.23 Model 6 [ 1 28 236792 ] (0.00 seconds, 250000 Inserts)
% 9.05/9.23
% 9.05/9.23 Stopped by limit on insertions
% 9.05/9.23
% 9.05/9.23 Model 7 [ 2 5 36214 ] (0.00 seconds, 250000 Inserts)
% 9.05/9.23
% 9.05/9.23 Stopped by limit on insertions
% 9.05/9.23
% 9.05/9.23 Model 8 [ 3 2 8366 ] (0.00 seconds, 250000 Inserts)
% 9.05/9.23
% 9.05/9.23 Stopped by limit on insertions
% 9.05/9.23
% 9.05/9.23 Stopped by limit on insertions
% 9.05/9.23
% 9.05/9.23 Model 9 [ 3 4 17692 ] (0.00 seconds, 250000 Inserts)
% 9.05/9.23
% 9.05/9.23 Stopped by limit on insertions
% 9.05/9.23
% 9.05/9.23 Model 10 [ 3 3 9108 ] (0.00 seconds, 250000 Inserts)
% 9.05/9.23
% 9.05/9.23 ----> UNIT CONFLICT at 8.84 sec ----> 212 [binary,211.1,4.1] {-} $F.
% 9.05/9.23
% 9.05/9.23 Length of proof is 7. Level of proof is 7.
% 9.05/9.23
% 9.05/9.23 ---------------- PROOF ----------------
% 9.05/9.23 % SZS status Unsatisfiable
% 9.05/9.23 % SZS output start Refutation
% 9.05/9.23
% 9.05/9.23 1 [] {+} theorem(A)| -axiom(A).
% 9.05/9.23 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 9.05/9.23 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 9.05/9.23 4 [] {+} -theorem(or(not(not(or(p,q))),or(not(p),not(q)))).
% 9.05/9.23 5 [] {+} axiom(or(not(or(A,A)),A)).
% 9.05/9.23 6 [] {+} axiom(or(not(A),or(B,A))).
% 9.05/9.23 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 9.05/9.23 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 9.05/9.23 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 9.05/9.23 29 [hyper,10,3,6] {+} theorem(or(not(A),A)).
% 9.05/9.23 36 [hyper,29,2,7] {+} theorem(or(A,not(A))).
% 9.05/9.23 63 [hyper,36,3,6] {-} theorem(or(not(A),not(not(or(B,A))))).
% 9.05/9.23 129 [hyper,63,2,7] {-} theorem(or(not(not(or(A,B))),not(B))).
% 9.05/9.23 136 [hyper,129,2,6] {-} theorem(or(A,or(not(not(or(B,C))),not(C)))).
% 9.05/9.23 211 [hyper,136,2,8] {-} theorem(or(not(not(or(A,B))),or(C,not(B)))).
% 9.05/9.23 212 [binary,211.1,4.1] {-} $F.
% 9.05/9.23
% 9.05/9.23 % SZS output end Refutation
% 9.05/9.23 ------------ end of proof -------------
% 9.05/9.23
% 9.05/9.23
% 9.05/9.23 Search stopped by max_proofs option.
% 9.05/9.23
% 9.05/9.23
% 9.05/9.23 Search stopped by max_proofs option.
% 9.05/9.23
% 9.05/9.23 ============ end of search ============
% 9.05/9.23
% 9.05/9.23 ----------- soft-scott stats ----------
% 9.05/9.23
% 9.05/9.23 true clauses given 11 (25.0%)
% 9.05/9.23 false clauses given 33
% 9.05/9.23
% 9.05/9.23 FALSE TRUE
% 9.05/9.23 7 0 2
% 9.05/9.23 9 0 20
% 9.05/9.23 11 11 28
% 9.05/9.23 12 0 1
% 9.05/9.23 13 16 21
% 9.05/9.23 14 0 4
% 9.05/9.23 15 11 12
% 9.05/9.23 16 0 1
% 9.05/9.23 17 9 3
% 9.05/9.23 19 7 1
% 9.05/9.23 21 3 1
% 9.05/9.23 22 0 1
% 9.05/9.23 27 0 1
% 9.05/9.23 tot: 57 96 (62.7% true)
% 9.05/9.23
% 9.05/9.23
% 9.05/9.23 Model 10 [ 3 3 9108 ] (0.00 seconds, 250000 Inserts)
% 9.05/9.23
% 9.05/9.23 That finishes the proof of the theorem.
% 9.05/9.23
% 9.05/9.23 Process 3224 finished Mon Jul 4 22:03:16 2022
%------------------------------------------------------------------------------