TSTP Solution File: LCL226-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL226-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:52 EDT 2022
% Result : Unsatisfiable 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL226-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 21:44:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n026.cluster.edu,
% 0.13/0.36 Sun Jul 3 21:44:06 2022
% 0.13/0.36 The command was "./sos". The process ID is 15252.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 2
% 0.19/0.39 number of clauses initially in problem: 11
% 0.19/0.39 percentage of clauses intially in UL: 18
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 33
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 9
% 0.19/0.39 distinct predicate count: 3
% 0.19/0.39 distinct function count: 3
% 0.19/0.39 distinct constant count: 3
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.19/0.44
% 0.19/0.44 -------- PROOF --------
% 0.19/0.44 % SZS status Unsatisfiable
% 0.19/0.44 % SZS output start Refutation
% 0.19/0.44
% 0.19/0.44 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.44
% 0.19/0.44 Stopped by limit on number of solutions
% 0.19/0.44
% 0.19/0.44 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.44
% 0.19/0.44 Stopped by limit on number of solutions
% 0.19/0.44
% 0.19/0.44 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.44
% 0.19/0.44 Stopped by limit on number of solutions
% 0.19/0.44
% 0.19/0.44 ----> UNIT CONFLICT at 0.06 sec ----> 389 [binary,388.1,13.1] {-} $F.
% 0.19/0.44
% 0.19/0.44 Length of proof is 7. Level of proof is 5.
% 0.19/0.44
% 0.19/0.44 ---------------- PROOF ----------------
% 0.19/0.44 % SZS status Unsatisfiable
% 0.19/0.44 % SZS output start Refutation
% 0.19/0.44
% 0.19/0.44 1 [] {+} theorem(A)| -axiom(A).
% 0.19/0.44 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 0.19/0.44 3 [] {-} -theorem(implies(or(q,r),implies(or(not(r),s),or(q,s)))).
% 0.19/0.44 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 0.19/0.44 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 0.19/0.44 9 [] {-} implies(A,B)=or(not(A),B).
% 0.19/0.44 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 0.19/0.44 13 [back_demod,3,demod,11] {-} -theorem(implies(or(q,r),implies(implies(r,s),or(q,s)))).
% 0.19/0.44 22 [para_into,7.1.1.1.2,10.1.1,demod,11] {-} axiom(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 0.19/0.44 24 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 0.19/0.44 28 [para_into,22.1.1.1,10.1.1,demod,11] {-} axiom(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 0.19/0.44 34 [hyper,28,1] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 0.19/0.44 388 [hyper,34,2,24] {-} theorem(implies(or(A,B),implies(implies(B,C),or(A,C)))).
% 0.19/0.44 389 [binary,388.1,13.1] {-} $F.
% 0.19/0.44
% 0.19/0.44 % SZS output end Refutation
% 0.19/0.44 ------------ end of proof -------------
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Search stopped by max_proofs option.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Search stopped by max_proofs option.
% 0.19/0.44
% 0.19/0.44 ============ end of search ============
% 0.19/0.44
% 0.19/0.44 ----------- soft-scott stats ----------
% 0.19/0.44
% 0.19/0.44 true clauses given 45 (80.4%)
% 0.19/0.44 false clauses given 11
% 0.19/0.44
% 0.19/0.44 FALSE TRUE
% 0.19/0.44 7 0 3
% 0.19/0.44 8 0 23
% 0.19/0.44 9 0 18
% 0.19/0.44 10 0 79
% 0.19/0.44 11 0 23
% 0.19/0.44 12 0 66
% 0.19/0.44 13 0 22
% 0.19/0.44 14 0 23
% 0.19/0.44 16 0 29
% 0.19/0.44 18 0 16
% 0.19/0.44 20 0 4
% 0.19/0.44 26 0 5
% 0.19/0.44 tot: 0 311 (100.0% true)
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.44
% 0.19/0.44 That finishes the proof of the theorem.
% 0.19/0.44
% 0.19/0.44 Process 15252 finished Sun Jul 3 21:44:06 2022
%------------------------------------------------------------------------------