TSTP Solution File: LCL178-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL178-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:22 EDT 2022
% Result : Unsatisfiable 1.20s 1.41s
% Output : Refutation 1.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL178-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n015.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 12:59:31 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n015.cluster.edu,
% 0.12/0.35 Mon Jul 4 12:59:31 2022
% 0.12/0.35 The command was "./sos". The process ID is 29914.
% 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=1, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.35 sos and nonpositive clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 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 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 3
% 0.12/0.39 number of clauses initially in problem: 11
% 0.12/0.39 percentage of clauses intially in UL: 27
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 71
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 7
% 0.12/0.39 distinct predicate count: 3
% 0.12/0.39 distinct function count: 3
% 0.12/0.39 distinct constant count: 1
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 1.20/1.41
% 1.20/1.41 -------- PROOF --------
% 1.20/1.41 % SZS status Unsatisfiable
% 1.20/1.41 % SZS output start Refutation
% 1.20/1.41
% 1.20/1.41 Model 3 (0.00 seconds, 0 Inserts)
% 1.20/1.41
% 1.20/1.41 Stopped by limit on number of solutions
% 1.20/1.41
% 1.20/1.41 Model 4 (0.00 seconds, 0 Inserts)
% 1.20/1.41
% 1.20/1.41 Stopped by limit on number of solutions
% 1.20/1.41
% 1.20/1.41 Stopped by limit on insertions
% 1.20/1.41
% 1.20/1.41 Model 5 [ 1 2 9910 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.41
% 1.20/1.41 Stopped by limit on insertions
% 1.20/1.41
% 1.20/1.41 Model 6 [ 21 1 2688 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.41
% 1.20/1.41 Stopped by limit on insertions
% 1.20/1.41
% 1.20/1.41 Model 7 [ 1 0 376 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.41
% 1.20/1.41 Model 8 [ 1 1 614 ] (0.00 seconds, 88258 Inserts)
% 1.20/1.41
% 1.20/1.41 Stopped by limit on insertions
% 1.20/1.41
% 1.20/1.41 Model 9 [ 1 0 1730 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.41
% 1.20/1.41 ----> UNIT CONFLICT at 1.03 sec ----> 726 [binary,725.1,3.1] {-} $F.
% 1.20/1.41
% 1.20/1.41 Length of proof is 17. Level of proof is 8.
% 1.20/1.41
% 1.20/1.41 ---------------- PROOF ----------------
% 1.20/1.41 % SZS status Unsatisfiable
% 1.20/1.41 % SZS output start Refutation
% 1.20/1.41
% 1.20/1.41 1 [] {+} theorem(A)| -axiom(A).
% 1.20/1.41 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 1.20/1.41 3 [] {+} -theorem(implies(p,not(not(p)))).
% 1.20/1.41 4 [] {+} axiom(implies(or(A,A),A)).
% 1.20/1.41 5 [] {+} axiom(implies(A,or(B,A))).
% 1.20/1.41 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 1.20/1.41 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.20/1.41 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.20/1.41 9 [] {-} implies(A,B)=or(not(A),B).
% 1.20/1.41 10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 1.20/1.41 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 1.20/1.41 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 1.20/1.41 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 1.20/1.41 20 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 1.20/1.41 24 [para_into,14.1.1.2,10.1.1] {+} theorem(implies(A,implies(B,A))).
% 1.20/1.41 28 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 1.20/1.41 29 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 1.20/1.41 30 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.20/1.41 40 [para_into,29.1.1.1,10.1.1] {-} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 1.20/1.41 128 [hyper,28,2,24] {+} theorem(or(implies(A,B),not(B))).
% 1.20/1.41 145 [hyper,128,2,14] {+} theorem(or(A,or(implies(B,C),not(C)))).
% 1.20/1.41 154 [hyper,30,2,29] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 1.20/1.41 503 [hyper,145,2,20] {+} theorem(or(implies(A,B),or(C,not(B)))).
% 1.20/1.41 642 [hyper,503,2,154] {+} theorem(or(implies(A,B),implies(B,C))).
% 1.20/1.41 677 [hyper,642,2,13] {+} theorem(implies(A,A)).
% 1.20/1.41 725 [hyper,677,2,40] {-} theorem(implies(A,not(not(A)))).
% 1.20/1.41 726 [binary,725.1,3.1] {-} $F.
% 1.20/1.41
% 1.20/1.41 % SZS output end Refutation
% 1.20/1.41 ------------ end of proof -------------
% 1.20/1.41
% 1.20/1.41
% 1.20/1.41 Search stopped by max_proofs option.
% 1.20/1.41
% 1.20/1.41
% 1.20/1.41 Search stopped by max_proofs option.
% 1.20/1.41
% 1.20/1.41 ============ end of search ============
% 1.20/1.41
% 1.20/1.41 ----------- soft-scott stats ----------
% 1.20/1.41
% 1.20/1.41 true clauses given 47 (37.6%)
% 1.20/1.41 false clauses given 78
% 1.20/1.41
% 1.20/1.41 FALSE TRUE
% 1.20/1.41 8 0 1
% 1.20/1.41 9 0 7
% 1.20/1.41 10 0 29
% 1.20/1.41 11 0 18
% 1.20/1.41 12 0 16
% 1.20/1.41 13 11 4
% 1.20/1.41 14 66 5
% 1.20/1.41 15 44 1
% 1.20/1.41 16 8 13
% 1.20/1.41 17 4 2
% 1.20/1.41 18 2 19
% 1.20/1.41 19 2 0
% 1.20/1.41 20 2 18
% 1.20/1.41 21 2 0
% 1.20/1.41 22 4 34
% 1.20/1.41 23 3 0
% 1.20/1.41 24 4 36
% 1.20/1.41 26 8 45
% 1.20/1.41 28 4 22
% 1.20/1.41 30 11 56
% 1.20/1.41 32 8 32
% 1.20/1.41 34 6 2
% 1.20/1.41 38 3 0
% 1.20/1.41 42 7 0
% 1.20/1.41 46 3 0
% 1.20/1.41 50 2 0
% 1.20/1.41 54 1 0
% 1.20/1.41 58 2 0
% 1.20/1.41 tot: 207 360 (63.5% true)
% 1.20/1.41
% 1.20/1.41
% 1.20/1.41 Model 9 [ 1 0 1730 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.41
% 1.20/1.41 That finishes the proof of the theorem.
% 1.20/1.41
% 1.20/1.41 Process 29914 finished Mon Jul 4 12:59:32 2022
%------------------------------------------------------------------------------