TSTP Solution File: LCL320-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL320-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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.22s 2.43s
% Output : Refutation 2.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL320-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.13 % Command : sos-script %s
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 2 11:20:44 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox2 on n013.cluster.edu,
% 0.14/0.37 Sat Jul 2 11:20:44 2022
% 0.14/0.37 The command was "./sos". The process ID is 8830.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.14/0.37
% 0.14/0.37 This is a Horn set with equality. The strategy will be
% 0.14/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.37 sos and nonpositive clauses in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: clear(order_hyper).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.14/0.40
% 0.14/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 -------------- Softie stats --------------
% 0.14/0.40
% 0.14/0.40 UPDATE_STOP: 300
% 0.14/0.40 SFINDER_TIME_LIMIT: 2
% 0.14/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40 number of clauses in intial UL: 3
% 0.14/0.40 number of clauses initially in problem: 11
% 0.14/0.40 percentage of clauses intially in UL: 27
% 0.14/0.40 percentage of distinct symbols occuring in initial UL: 87
% 0.14/0.40 percent of all initial clauses that are short: 100
% 0.14/0.40 absolute distinct symbol count: 8
% 0.14/0.40 distinct predicate count: 3
% 0.14/0.40 distinct function count: 3
% 0.14/0.40 distinct constant count: 2
% 0.14/0.40
% 0.14/0.40 ---------- no more Softie stats ----------
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40 =========== start of search ===========
% 2.22/2.43
% 2.22/2.43 -------- PROOF --------
% 2.22/2.43 % SZS status Unsatisfiable
% 2.22/2.43 % SZS output start Refutation
% 2.22/2.43
% 2.22/2.43 Model 3 (0.00 seconds, 0 Inserts)
% 2.22/2.43
% 2.22/2.43 Stopped by limit on number of solutions
% 2.22/2.43
% 2.22/2.43 Model 4 (0.00 seconds, 0 Inserts)
% 2.22/2.43
% 2.22/2.43 Stopped by limit on number of solutions
% 2.22/2.43
% 2.22/2.43 Stopped by limit on insertions
% 2.22/2.43
% 2.22/2.43 Stopped by limit on insertions
% 2.22/2.43
% 2.22/2.43 Model 5 [ 1 1 556 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 Stopped by limit on insertions
% 2.22/2.43
% 2.22/2.43 Model 6 [ 1 0 50 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 Stopped by limit on insertions
% 2.22/2.43
% 2.22/2.43 Model 7 [ 1 1 290 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 Stopped by limit on insertions
% 2.22/2.43
% 2.22/2.43 Model 8 [ 1 1 1494 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 Stopped by limit on insertions
% 2.22/2.43
% 2.22/2.43 Model 9 [ 2 0 815 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 Stopped by limit on insertions
% 2.22/2.43
% 2.22/2.43 Model 10 [ 2 2 6737 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 ----> UNIT CONFLICT at 2.04 sec ----> 414 [binary,413.1,3.1] {-} $F.
% 2.22/2.43
% 2.22/2.43 Length of proof is 12. Level of proof is 7.
% 2.22/2.43
% 2.22/2.43 ---------------- PROOF ----------------
% 2.22/2.43 % SZS status Unsatisfiable
% 2.22/2.43 % SZS output start Refutation
% 2.22/2.43
% 2.22/2.43 1 [] {+} theorem(A)| -axiom(A).
% 2.22/2.43 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 2.22/2.43 3 [] {+} -theorem(or(implies(p,q),implies(not(p),q))).
% 2.22/2.43 5 [] {+} axiom(implies(A,or(B,A))).
% 2.22/2.43 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 2.22/2.43 8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 2.22/2.43 9 [] {-} implies(A,B)=or(not(A),B).
% 2.22/2.43 11,10 [copy,9,flip.1] {-} or(not(A),B)=implies(A,B).
% 2.22/2.43 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 2.22/2.43 15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 2.22/2.43 24 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 2.22/2.43 25 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 2.22/2.43 28 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 2.22/2.43 155 [hyper,28,2,25] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 2.22/2.43 168 [para_into,155.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,not(C))),implies(A,implies(C,B)))).
% 2.22/2.43 175 [hyper,168,2,14] {+} theorem(implies(not(A),implies(A,B))).
% 2.22/2.43 179 [hyper,175,2,28] {-} theorem(implies(or(A,not(B)),or(A,implies(B,C)))).
% 2.22/2.43 180 [hyper,175,2,24] {-} theorem(or(implies(A,B),not(not(A)))).
% 2.22/2.43 413 [hyper,179,2,180] {-} theorem(or(implies(A,B),implies(not(A),C))).
% 2.22/2.43 414 [binary,413.1,3.1] {-} $F.
% 2.22/2.43
% 2.22/2.43 % SZS output end Refutation
% 2.22/2.43 ------------ end of proof -------------
% 2.22/2.43
% 2.22/2.43
% 2.22/2.43 Search stopped by max_proofs option.
% 2.22/2.43
% 2.22/2.43
% 2.22/2.43 Search stopped by max_proofs option.
% 2.22/2.43
% 2.22/2.43 ============ end of search ============
% 2.22/2.43
% 2.22/2.43 ----------- soft-scott stats ----------
% 2.22/2.43
% 2.22/2.43 true clauses given 26 (31.0%)
% 2.22/2.43 false clauses given 58
% 2.22/2.43
% 2.22/2.43 FALSE TRUE
% 2.22/2.43 6 0 1
% 2.22/2.43 8 0 11
% 2.22/2.43 9 0 15
% 2.22/2.43 10 0 41
% 2.22/2.43 11 14 30
% 2.22/2.43 12 22 23
% 2.22/2.43 13 8 3
% 2.22/2.43 14 13 12
% 2.22/2.43 15 33 0
% 2.22/2.43 16 18 3
% 2.22/2.43 17 2 0
% 2.22/2.43 18 5 8
% 2.22/2.43 20 10 1
% 2.22/2.43 22 8 4
% 2.22/2.43 24 4 0
% 2.22/2.43 26 3 2
% 2.22/2.43 28 11 0
% 2.22/2.43 30 5 0
% 2.22/2.43 tot: 156 154 (49.7% true)
% 2.22/2.43
% 2.22/2.43
% 2.22/2.43 Model 10 [ 2 2 6737 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 That finishes the proof of the theorem.
% 2.22/2.43
% 2.22/2.43 Process 8830 finished Sat Jul 2 11:20:46 2022
%------------------------------------------------------------------------------