TSTP Solution File: LCL261-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL261-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:12 EDT 2022
% Result : Unsatisfiable 10.93s 11.10s
% Output : Refutation 10.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL261-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n011.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 08:57:50 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 ----- Otter 3.2, August 2001 -----
% 0.14/0.35 The process was started by sandbox2 on n011.cluster.edu,
% 0.14/0.35 Sun Jul 3 08:57:50 2022
% 0.14/0.35 The command was "./sos". The process ID is 18188.
% 0.14/0.35
% 0.14/0.35 set(prolog_style_variables).
% 0.14/0.35 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 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.39
% 0.14/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 -------------- Softie stats --------------
% 0.14/0.39
% 0.14/0.39 UPDATE_STOP: 300
% 0.14/0.39 SFINDER_TIME_LIMIT: 2
% 0.14/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.39 number of clauses in intial UL: 2
% 0.14/0.39 number of clauses initially in problem: 13
% 0.14/0.39 percentage of clauses intially in UL: 15
% 0.14/0.39 percentage of distinct symbols occuring in initial UL: 33
% 0.14/0.39 percent of all initial clauses that are short: 100
% 0.14/0.39 absolute distinct symbol count: 9
% 0.14/0.39 distinct predicate count: 3
% 0.14/0.39 distinct function count: 4
% 0.14/0.39 distinct constant count: 2
% 0.14/0.39
% 0.14/0.39 ---------- no more Softie stats ----------
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39 =========== start of search ===========
% 1.06/1.28
% 1.06/1.28
% 1.06/1.28 Changing weight limit from 60 to 32.
% 1.06/1.28
% 1.06/1.28 Model 3 (0.00 seconds, 0 Inserts)
% 1.06/1.28
% 1.06/1.28 Stopped by limit on number of solutions
% 1.06/1.28
% 1.06/1.28 Stopped by limit on insertions
% 1.06/1.28
% 1.06/1.28 Model 4 [ 1 1 542 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.28
% 1.06/1.28 Model 5 (0.00 seconds, 250000 Inserts)
% 1.06/1.28
% 1.06/1.28 Stopped by limit on number of solutions
% 1.06/1.28
% 1.06/1.28 Stopped by limit on insertions
% 1.06/1.28
% 1.06/1.28 Model 6 [ 3 1 3141 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.28
% 1.06/1.28 Stopped by limit on insertions
% 1.06/1.28
% 1.06/1.28 Model 7 [ 30 0 92 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.28
% 1.06/1.28 Stopped by limit on insertions
% 1.06/1.28
% 1.06/1.28 Model 8 [ 2 1 577 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.28
% 1.06/1.28 Stopped by limit on insertions
% 1.06/1.28
% 1.06/1.28 Model 9 [ 3 0 6525 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.28
% 1.06/1.28 Stopped by limit on insertions
% 1.06/1.28
% 1.06/1.28 Model 10 [ 27 0 54 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.28
% 1.06/1.28 Resetting weight limit to 32 after 190 givens.
% 1.06/1.28
% 10.93/11.10
% 10.93/11.10 -- HEY sandbox2, WE HAVE A PROOF!! --
% 10.93/11.10
% 10.93/11.10 Modelling stopped after 300 given clauses and 0.00 seconds
% 10.93/11.10
% 10.93/11.10
% 10.93/11.10 ----> UNIT CONFLICT at 10.69 sec ----> 41571 [binary,41570.1,16.1] {+} $F.
% 10.93/11.10
% 10.93/11.10 Length of proof is 18. Level of proof is 8.
% 10.93/11.10
% 10.93/11.10 ---------------- PROOF ----------------
% 10.93/11.10 % SZS status Unsatisfiable
% 10.93/11.10 % SZS output start Refutation
% 10.93/11.10
% 10.93/11.10 1 [] {+} theorem(A)| -axiom(A).
% 10.93/11.10 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 10.93/11.10 3 [] {-} -theorem(or(not(p),or(not(q),and(p,q)))).
% 10.93/11.10 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 10.93/11.10 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 10.93/11.10 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 10.93/11.10 9 [] {-} implies(A,B)=or(not(A),B).
% 10.93/11.10 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 10.93/11.10 12 [] {-} and(A,B)=not(or(not(A),not(B))).
% 10.93/11.10 13 [copy,12,demod,11,flip.1] {-} not(implies(A,not(B)))=and(A,B).
% 10.93/11.10 16 [back_demod,3,demod,11,11] {+} -theorem(implies(p,implies(q,and(p,q)))).
% 10.93/11.10 19 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 10.93/11.10 22 [para_from,10.1.1,7.1.1.2,demod,11] {-} axiom(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 10.93/11.10 23 [para_from,10.1.1,7.1.1.2.2,demod,11] {-} axiom(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 10.93/11.10 25 [para_from,10.1.1,6.1.1.2] {-} axiom(implies(or(A,not(B)),implies(B,A))).
% 10.93/11.10 39 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 10.93/11.10 41 [hyper,25,1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 10.93/11.10 47 [para_into,41.1.1.1,10.1.1] {-} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 10.93/11.10 64 [hyper,22,1] {+} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 10.93/11.10 69 [hyper,23,1] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 10.93/11.10 277 [hyper,39,2,47] {+} theorem(implies(or(A,implies(B,not(C))),or(A,implies(C,not(B))))).
% 10.93/11.10 565 [para_into,64.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 10.93/11.10 1501 [hyper,69,2,19] {+} theorem(or(A,implies(or(B,A),B))).
% 10.93/11.10 14724 [hyper,277,2,1501,demod,11] {+} theorem(or(A,implies(B,not(implies(B,A))))).
% 10.93/11.10 41451 [para_into,14724.1.1.2.2,13.1.1,demod,11] {+} theorem(implies(A,implies(B,and(B,A)))).
% 10.93/11.10 41570 [hyper,41451,2,565] {-} theorem(implies(A,implies(B,and(A,B)))).
% 10.93/11.10 41571 [binary,41570.1,16.1] {+} $F.
% 10.93/11.10
% 10.93/11.10 % SZS output end Refutation
% 10.93/11.10 ------------ end of proof -------------
% 10.93/11.10
% 10.93/11.10
% 10.93/11.10 Search stopped by max_proofs option.
% 10.93/11.10
% 10.93/11.10
% 10.93/11.10 Search stopped by max_proofs option.
% 10.93/11.10
% 10.93/11.10 ============ end of search ============
% 10.93/11.10
% 10.93/11.10 ----------- soft-scott stats ----------
% 10.93/11.10
% 10.93/11.10 true clauses given 423 (38.6%)
% 10.93/11.10 false clauses given 674
% 10.93/11.10
% 10.93/11.10 FALSE TRUE
% 10.93/11.10 9 0 79
% 10.93/11.10 10 0 525
% 10.93/11.10 11 0 770
% 10.93/11.10 12 0 1124
% 10.93/11.10 14 0 6
% 10.93/11.10 15 0 1
% 10.93/11.10 16 0 14
% 10.93/11.10 17 0 3
% 10.93/11.10 18 0 4
% 10.93/11.10 19 0 3
% 10.93/11.10 20 0 1
% 10.93/11.10 22 0 1
% 10.93/11.10 24 0 2
% 10.93/11.10 26 0 3
% 10.93/11.10 27 0 1
% 10.93/11.10 28 192 4
% 10.93/11.10 29 212 3
% 10.93/11.10 30 412 0
% 10.93/11.10 31 523 3
% 10.93/11.10 32 606 4
% 10.93/11.10 tot: 1945 2551 (56.7% true)
% 10.93/11.10
% 10.93/11.10
% 10.93/11.10 Model 10 [ 27 0 54 ] (0.00 seconds, 250000 Inserts)
% 10.93/11.10
% 10.93/11.10 That finishes the proof of the theorem.
% 10.93/11.10
% 10.93/11.10 Process 18188 finished Sun Jul 3 08:58:01 2022
%------------------------------------------------------------------------------