TSTP Solution File: LCL321-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL321-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:29:29 EDT 2022
% Result : Unsatisfiable 2.04s 2.24s
% Output : Refutation 2.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL321-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 3 18:57:45 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n020.cluster.edu,
% 0.14/0.36 Sun Jul 3 18:57:45 2022
% 0.14/0.36 The command was "./sos". The process ID is 10387.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.14/0.36
% 0.14/0.36 This is a Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.36 sos and nonpositive clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: clear(order_hyper).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/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: 3
% 0.19/0.40 number of clauses initially in problem: 11
% 0.19/0.40 percentage of clauses intially in UL: 27
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 87
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 8
% 0.19/0.40 distinct predicate count: 3
% 0.19/0.40 distinct function count: 3
% 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 ===========
% 2.04/2.24
% 2.04/2.24 -------- PROOF --------
% 2.04/2.24 % SZS status Unsatisfiable
% 2.04/2.24 % SZS output start Refutation
% 2.04/2.24
% 2.04/2.24 Model 3 (0.00 seconds, 0 Inserts)
% 2.04/2.24
% 2.04/2.24 Stopped by limit on number of solutions
% 2.04/2.24
% 2.04/2.24 Model 4 (0.00 seconds, 0 Inserts)
% 2.04/2.24
% 2.04/2.24 Stopped by limit on number of solutions
% 2.04/2.24
% 2.04/2.24 Stopped by limit on insertions
% 2.04/2.24
% 2.04/2.24 Model 5 [ 1 1 2313 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.24
% 2.04/2.24 Stopped by limit on insertions
% 2.04/2.24
% 2.04/2.24 Model 6 [ 1 1 3866 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.24
% 2.04/2.24 Stopped by limit on insertions
% 2.04/2.24
% 2.04/2.24 Model 7 [ 1 1 2972 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.24
% 2.04/2.24 Stopped by limit on insertions
% 2.04/2.24
% 2.04/2.24 Model 8 [ 1 1 3012 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.24
% 2.04/2.24 Stopped by limit on insertions
% 2.04/2.24
% 2.04/2.24 Stopped by limit on insertions
% 2.04/2.24
% 2.04/2.24 Stopped by limit on insertions
% 2.04/2.24
% 2.04/2.24 Model 9 [ 1 0 357 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.24
% 2.04/2.24 ----> UNIT CONFLICT at 1.85 sec ----> 152 [binary,151.1,3.1] {-} $F.
% 2.04/2.24
% 2.04/2.24 Length of proof is 9. Level of proof is 4.
% 2.04/2.24
% 2.04/2.24 ---------------- PROOF ----------------
% 2.04/2.24 % SZS status Unsatisfiable
% 2.04/2.24 % SZS output start Refutation
% 2.04/2.24
% 2.04/2.24 1 [] {+} theorem(A)| -axiom(A).
% 2.04/2.24 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 2.04/2.24 3 [] {+} -theorem(or(implies(p,q),implies(p,not(q)))).
% 2.04/2.24 5 [] {+} axiom(implies(A,or(B,A))).
% 2.04/2.24 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 2.04/2.24 8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 2.04/2.24 9 [] {-} implies(A,B)=or(not(A),B).
% 2.04/2.24 10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 2.04/2.24 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 2.04/2.24 15 [hyper,6,1] {-} theorem(implies(or(A,B),or(B,A))).
% 2.04/2.24 24 [para_into,14.1.1.2,10.1.1] {+} theorem(implies(A,implies(B,A))).
% 2.04/2.24 27 [para_into,15.1.1.1,10.1.1] {-} theorem(implies(implies(A,B),or(B,not(A)))).
% 2.04/2.24 29 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 2.04/2.24 43 [hyper,24,2,27] {+} theorem(or(implies(A,B),not(B))).
% 2.04/2.24 138 [hyper,29,2,24] {-} theorem(implies(or(A,B),or(A,implies(C,B)))).
% 2.04/2.24 151 [hyper,138,2,43] {-} theorem(or(implies(A,B),implies(C,not(B)))).
% 2.04/2.24 152 [binary,151.1,3.1] {-} $F.
% 2.04/2.24
% 2.04/2.24 % SZS output end Refutation
% 2.04/2.24 ------------ end of proof -------------
% 2.04/2.24
% 2.04/2.24
% 2.04/2.24 Search stopped by max_proofs option.
% 2.04/2.24
% 2.04/2.24
% 2.04/2.24 Search stopped by max_proofs option.
% 2.04/2.24
% 2.04/2.24 ============ end of search ============
% 2.04/2.24
% 2.04/2.24 ----------- soft-scott stats ----------
% 2.04/2.24
% 2.04/2.24 true clauses given 12 (28.6%)
% 2.04/2.24 false clauses given 30
% 2.04/2.24
% 2.04/2.24 FALSE TRUE
% 2.04/2.24 8 0 5
% 2.04/2.24 9 0 8
% 2.04/2.24 10 0 13
% 2.04/2.24 11 0 2
% 2.04/2.24 12 15 6
% 2.04/2.24 13 10 2
% 2.04/2.24 14 6 2
% 2.04/2.24 16 4 1
% 2.04/2.24 18 6 0
% 2.04/2.24 20 2 0
% 2.04/2.24 22 6 0
% 2.04/2.24 24 4 0
% 2.04/2.24 26 2 0
% 2.04/2.24 tot: 55 39 (41.5% true)
% 2.04/2.24
% 2.04/2.24
% 2.04/2.24 Model 9 [ 1 0 357 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.24
% 2.04/2.24 That finishes the proof of the theorem.
% 2.04/2.24
% 2.04/2.24 Process 10387 finished Sun Jul 3 18:57:46 2022
%------------------------------------------------------------------------------