TSTP Solution File: LCL185-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL185-3 : TPTP v8.1.0. Released v2.3.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:26 EDT 2022
% Result : Unsatisfiable 1.06s 1.25s
% Output : Refutation 1.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL185-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.11 % Command : sos-script %s
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jul 3 20:21:22 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox on n005.cluster.edu,
% 0.11/0.34 Sun Jul 3 20:21:22 2022
% 0.11/0.34 The command was "./sos". The process ID is 19083.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.11/0.34
% 0.11/0.34 This is a Horn set with equality. The strategy will be
% 0.11/0.34 Knuth-Bendix and hyper_res, with positive clauses in
% 0.11/0.34 sos and nonpositive clauses in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(knuth_bendix).
% 0.11/0.34 dependent: set(para_from).
% 0.11/0.34 dependent: set(para_into).
% 0.11/0.34 dependent: clear(para_from_right).
% 0.11/0.34 dependent: clear(para_into_right).
% 0.11/0.34 dependent: set(para_from_vars).
% 0.11/0.34 dependent: set(eq_units_both_ways).
% 0.11/0.34 dependent: set(dynamic_demod_all).
% 0.11/0.34 dependent: set(dynamic_demod).
% 0.11/0.34 dependent: set(order_eq).
% 0.11/0.34 dependent: set(back_demod).
% 0.11/0.34 dependent: set(lrpo).
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: clear(order_hyper).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.17/0.38
% 0.17/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.38
% 0.17/0.38 Stopped by limit on number of solutions
% 0.17/0.38
% 0.17/0.38
% 0.17/0.38 -------------- Softie stats --------------
% 0.17/0.38
% 0.17/0.38 UPDATE_STOP: 300
% 0.17/0.38 SFINDER_TIME_LIMIT: 2
% 0.17/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.38 number of clauses in intial UL: 3
% 0.17/0.38 number of clauses initially in problem: 11
% 0.17/0.38 percentage of clauses intially in UL: 27
% 0.17/0.38 percentage of distinct symbols occuring in initial UL: 75
% 0.17/0.38 percent of all initial clauses that are short: 100
% 0.17/0.38 absolute distinct symbol count: 8
% 0.17/0.38 distinct predicate count: 3
% 0.17/0.38 distinct function count: 3
% 0.17/0.38 distinct constant count: 2
% 0.17/0.38
% 0.17/0.38 ---------- no more Softie stats ----------
% 0.17/0.38
% 0.17/0.38
% 0.17/0.38
% 0.17/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.17/0.38
% 0.17/0.38 Stopped by limit on number of solutions
% 0.17/0.38
% 0.17/0.38 =========== start of search ===========
% 1.06/1.25
% 1.06/1.25 -------- PROOF --------
% 1.06/1.25 % SZS status Unsatisfiable
% 1.06/1.25 % SZS output start Refutation
% 1.06/1.25
% 1.06/1.25 Model 3 (0.00 seconds, 0 Inserts)
% 1.06/1.25
% 1.06/1.25 Stopped by limit on number of solutions
% 1.06/1.25
% 1.06/1.25 Model 4 (0.00 seconds, 0 Inserts)
% 1.06/1.25
% 1.06/1.25 Stopped by limit on number of solutions
% 1.06/1.25
% 1.06/1.25 Stopped by limit on insertions
% 1.06/1.25
% 1.06/1.25 Model 5 [ 21 1 117 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.25
% 1.06/1.25 Stopped by limit on insertions
% 1.06/1.25
% 1.06/1.25 Model 6 [ 1 1 11630 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.25
% 1.06/1.25 Stopped by limit on insertions
% 1.06/1.25
% 1.06/1.25 Model 7 [ 1 1 6275 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.25
% 1.06/1.25 Stopped by limit on insertions
% 1.06/1.25
% 1.06/1.25 Model 8 [ 1 0 1252 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.25
% 1.06/1.25 ----> UNIT CONFLICT at 0.88 sec ----> 378 [binary,377.1,3.1] {-} $F.
% 1.06/1.25
% 1.06/1.25 Length of proof is 7. Level of proof is 4.
% 1.06/1.25
% 1.06/1.25 ---------------- PROOF ----------------
% 1.06/1.25 % SZS status Unsatisfiable
% 1.06/1.25 % SZS output start Refutation
% 1.06/1.25
% 1.06/1.25 1 [] {+} theorem(A)| -axiom(A).
% 1.06/1.25 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 1.06/1.25 3 [] {+} -theorem(implies(p,or(p,q))).
% 1.06/1.25 5 [] {+} axiom(implies(A,or(B,A))).
% 1.06/1.25 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 1.06/1.25 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.06/1.25 9 [] {-} implies(A,B)=or(not(A),B).
% 1.06/1.25 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 1.06/1.25 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 1.06/1.25 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 1.06/1.25 29 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 1.06/1.25 62 [hyper,29,2,15] {-} theorem(implies(or(A,or(B,C)),or(A,or(C,B)))).
% 1.06/1.25 183 [para_into,62.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),implies(A,or(C,B)))).
% 1.06/1.25 377 [hyper,183,2,14] {-} theorem(implies(A,or(A,B))).
% 1.06/1.25 378 [binary,377.1,3.1] {-} $F.
% 1.06/1.25
% 1.06/1.25 % SZS output end Refutation
% 1.06/1.25 ------------ end of proof -------------
% 1.06/1.25
% 1.06/1.25
% 1.06/1.25 Search stopped by max_proofs option.
% 1.06/1.25
% 1.06/1.25
% 1.06/1.25 Search stopped by max_proofs option.
% 1.06/1.25
% 1.06/1.25 ============ end of search ============
% 1.06/1.25
% 1.06/1.25 ----------- soft-scott stats ----------
% 1.06/1.25
% 1.06/1.25 true clauses given 22 (32.8%)
% 1.06/1.25 false clauses given 45
% 1.06/1.25
% 1.06/1.25 FALSE TRUE
% 1.06/1.25 7 0 3
% 1.06/1.25 8 0 5
% 1.06/1.25 9 0 3
% 1.06/1.25 10 0 32
% 1.06/1.25 11 0 12
% 1.06/1.25 12 7 48
% 1.06/1.25 13 13 18
% 1.06/1.25 14 41 25
% 1.06/1.25 15 18 0
% 1.06/1.25 16 39 12
% 1.06/1.25 17 8 0
% 1.06/1.25 tot: 126 158 (55.6% true)
% 1.06/1.25
% 1.06/1.25
% 1.06/1.25 Model 8 [ 1 0 1252 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.25
% 1.06/1.25 That finishes the proof of the theorem.
% 1.06/1.25
% 1.06/1.25 Process 19083 finished Sun Jul 3 20:21:23 2022
%------------------------------------------------------------------------------