TSTP Solution File: LCL216-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL216-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:46 EDT 2022
% Result : Unsatisfiable 1.94s 2.19s
% Output : Refutation 1.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL216-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 23:58:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox on n024.cluster.edu,
% 0.19/0.36 Mon Jul 4 23:58:44 2022
% 0.19/0.36 The command was "./sos". The process ID is 30150.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.19/0.36
% 0.19/0.36 This is a Horn set without equality. The strategy will
% 0.19/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.19/0.36 in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: clear(order_hyper).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 4
% 0.19/0.40 number of clauses initially in problem: 9
% 0.19/0.40 percentage of clauses intially in UL: 44
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 6
% 0.19/0.40 distinct predicate count: 2
% 0.19/0.40 distinct function count: 2
% 0.19/0.40 distinct constant count: 2
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 1.94/2.19
% 1.94/2.19 -------- PROOF --------
% 1.94/2.19 % SZS status Unsatisfiable
% 1.94/2.19 % SZS output start Refutation
% 1.94/2.19
% 1.94/2.19 Model 3 (0.00 seconds, 0 Inserts)
% 1.94/2.19
% 1.94/2.19 Stopped by limit on number of solutions
% 1.94/2.19
% 1.94/2.19 Stopped by limit on insertions
% 1.94/2.19
% 1.94/2.19 Model 4 [ 12 1 68 ] (0.00 seconds, 250000 Inserts)
% 1.94/2.19
% 1.94/2.19 Stopped by limit on insertions
% 1.94/2.19
% 1.94/2.19 Model 5 (0.00 seconds, 250000 Inserts)
% 1.94/2.19
% 1.94/2.19 Stopped by limit on number of solutions
% 1.94/2.19
% 1.94/2.19 Model 6 (0.00 seconds, 250000 Inserts)
% 1.94/2.19
% 1.94/2.19 Stopped by limit on number of solutions
% 1.94/2.19
% 1.94/2.19 Modelling stopped after 300 given clauses and 0.00 seconds
% 1.94/2.19
% 1.94/2.19
% 1.94/2.19 ----> UNIT CONFLICT at 1.80 sec ----> 2136 [binary,2135.1,4.1] {-} $F.
% 1.94/2.19
% 1.94/2.19 Length of proof is 5. Level of proof is 5.
% 1.94/2.19
% 1.94/2.19 ---------------- PROOF ----------------
% 1.94/2.19 % SZS status Unsatisfiable
% 1.94/2.19 % SZS output start Refutation
% 1.94/2.19
% 1.94/2.19 1 [] {+} theorem(A)| -axiom(A).
% 1.94/2.19 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 1.94/2.19 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 1.94/2.19 4 [] {+} -theorem(or(not(or(p,q)),or(not(or(p,not(q))),p))).
% 1.94/2.19 5 [] {+} axiom(or(not(or(A,A)),A)).
% 1.94/2.19 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 1.94/2.19 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 1.94/2.19 9 [] {-} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 1.94/2.19 10 [hyper,5,1] {-} theorem(or(not(or(A,A)),A)).
% 1.94/2.19 57 [hyper,9,2,10] {+} theorem(or(not(or(A,or(B,B))),or(A,B))).
% 1.94/2.19 623 [hyper,57,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))).
% 1.94/2.19 1297 [hyper,623,3,7] {-} theorem(or(not(or(A,not(B))),or(not(or(A,B)),A))).
% 1.94/2.19 2135 [hyper,1297,2,8] {-} theorem(or(not(or(A,B)),or(not(or(A,not(B))),A))).
% 1.94/2.19 2136 [binary,2135.1,4.1] {-} $F.
% 1.94/2.19
% 1.94/2.19 % SZS output end Refutation
% 1.94/2.19 ------------ end of proof -------------
% 1.94/2.19
% 1.94/2.19
% 1.94/2.19 Search stopped by max_proofs option.
% 1.94/2.19
% 1.94/2.19
% 1.94/2.19 Search stopped by max_proofs option.
% 1.94/2.19
% 1.94/2.19 ============ end of search ============
% 1.94/2.19
% 1.94/2.19 ----------- soft-scott stats ----------
% 1.94/2.19
% 1.94/2.19 true clauses given 144 (28.0%)
% 1.94/2.19 false clauses given 371
% 1.94/2.19
% 1.94/2.19 FALSE TRUE
% 1.94/2.19 11 0 118
% 1.94/2.19 12 0 1
% 1.94/2.19 13 87 103
% 1.94/2.19 14 2 8
% 1.94/2.19 15 350 74
% 1.94/2.19 16 4 10
% 1.94/2.19 17 212 46
% 1.94/2.19 18 21 7
% 1.94/2.19 19 131 32
% 1.94/2.19 20 25 9
% 1.94/2.19 21 90 13
% 1.94/2.19 22 16 5
% 1.94/2.19 23 47 2
% 1.94/2.19 24 5 1
% 1.94/2.19 25 22 1
% 1.94/2.19 26 8 0
% 1.94/2.19 27 9 3
% 1.94/2.19 28 10 0
% 1.94/2.19 29 5 0
% 1.94/2.19 31 7 0
% 1.94/2.19 32 1 0
% 1.94/2.19 33 10 0
% 1.94/2.19 35 1 0
% 1.94/2.19 36 1 0
% 1.94/2.19 37 3 1
% 1.94/2.19 47 1 0
% 1.94/2.19 tot: 1068 434 (28.9% true)
% 1.94/2.19
% 1.94/2.19
% 1.94/2.19 Model 6 (0.00 seconds, 250000 Inserts)
% 1.94/2.19
% 1.94/2.19 That finishes the proof of the theorem.
% 1.94/2.19
% 1.94/2.19 Process 30150 finished Mon Jul 4 23:58:46 2022
%------------------------------------------------------------------------------