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