TSTP Solution File: LCL381-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL381-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:48 EDT 2022
% Result : Unsatisfiable 8.81s 9.00s
% Output : Refutation 8.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL381-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n007.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 14:13:41 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 sandbox on n007.cluster.edu,
% 0.13/0.36 Sun Jul 3 14:13:41 2022
% 0.13/0.36 The command was "./sos". The process ID is 9117.
% 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=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set without equality. The strategy will
% 0.13/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36 in usable.
% 0.13/0.36
% 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
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 2
% 0.13/0.38 number of clauses initially in problem: 5
% 0.13/0.38 percentage of clauses intially in UL: 40
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 6
% 0.13/0.38 distinct predicate count: 1
% 0.13/0.38 distinct function count: 2
% 0.13/0.38 distinct constant count: 3
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 4.00/4.20
% 4.00/4.20
% 4.00/4.20 Changing weight limit from 60 to 49.
% 4.00/4.20
% 4.00/4.20 Model 2 (0.00 seconds, 0 Inserts)
% 4.00/4.20
% 4.00/4.20 Stopped by limit on number of solutions
% 4.00/4.20
% 4.00/4.20 Model 3 (0.00 seconds, 0 Inserts)
% 4.00/4.20
% 4.00/4.20 Stopped by limit on number of solutions
% 4.00/4.20
% 4.00/4.20 Stopped by limit on insertions
% 4.00/4.20
% 4.00/4.20 Model 4 [ 1 1 289 ] (0.00 seconds, 250000 Inserts)
% 4.00/4.20
% 4.00/4.20 Resetting weight limit to 49 after 150 givens.
% 4.00/4.20
% 8.81/9.00
% 8.81/9.00 -------- PROOF --------
% 8.81/9.00 % SZS status Unsatisfiable
% 8.81/9.00 % SZS output start Refutation
% 8.81/9.00
% 8.81/9.00 Stopped by limit on insertions
% 8.81/9.00
% 8.81/9.00 ----> UNIT CONFLICT at 8.61 sec ----> 5039 [binary,5038.1,2.1] {-} $F.
% 8.81/9.00
% 8.81/9.00 Length of proof is 28. Level of proof is 18.
% 8.81/9.00
% 8.81/9.00 ---------------- PROOF ----------------
% 8.81/9.00 % SZS status Unsatisfiable
% 8.81/9.00 % SZS output start Refutation
% 8.81/9.00
% 8.81/9.00 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 8.81/9.00 2 [] {+} -is_a_theorem(implies(implies(implies(not(not(x)),y),z),implies(implies(x,y),z))).
% 8.81/9.00 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 8.81/9.00 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 8.81/9.00 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 8.81/9.00 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 8.81/9.00 7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 8.81/9.00 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 8.81/9.00 13 [hyper,9,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(not(A),D),B),C))).
% 8.81/9.00 15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 8.81/9.00 18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 8.81/9.00 21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 8.81/9.00 23 [hyper,6,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(implies(A,C),D),implies(implies(B,C),D)))).
% 8.81/9.00 24 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 8.81/9.00 26 [hyper,21,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 8.81/9.00 42 [hyper,7,1,9] {-} is_a_theorem(implies(implies(not(implies(implies(not(A),B),C)),implies(implies(not(A),B),C)),implies(A,C))).
% 8.81/9.00 55 [hyper,24,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 8.81/9.00 71 [hyper,55,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 8.81/9.00 85 [hyper,71,1,15] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 8.81/9.00 111 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 8.81/9.00 162 [hyper,111,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 8.81/9.00 203 [hyper,162,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 8.81/9.00 437 [hyper,203,1,18] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 8.81/9.00 4075 [hyper,437,1,26] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 8.81/9.00 4139 [hyper,4075,1,437] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 8.81/9.00 4210 [hyper,4139,1,4139] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 8.81/9.00 4232 [hyper,4139,1,42] {+} is_a_theorem(implies(A,implies(B,A))).
% 8.81/9.00 4273 [hyper,4210,1,437] {-} is_a_theorem(implies(A,implies(implies(not(B),not(not(B))),B))).
% 8.81/9.00 4315 [hyper,4232,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 8.81/9.00 4331 [hyper,4273,1,4273] {-} is_a_theorem(implies(implies(not(A),not(not(A))),A)).
% 8.81/9.00 4429 [hyper,4331,1,13] {-} is_a_theorem(implies(implies(implies(not(not(A)),B),not(not(A))),A)).
% 8.81/9.00 4984 [hyper,4315,1,4429] {-} is_a_theorem(implies(not(not(A)),A)).
% 8.81/9.00 5038 [hyper,4984,1,23] {-} is_a_theorem(implies(implies(implies(not(not(A)),B),C),implies(implies(A,B),C))).
% 8.81/9.00 5039 [binary,5038.1,2.1] {-} $F.
% 8.81/9.00
% 8.81/9.00 % SZS output end Refutation
% 8.81/9.00 ------------ end of proof -------------
% 8.81/9.00
% 8.81/9.00
% 8.81/9.00 Search stopped by max_proofs option.
% 8.81/9.00
% 8.81/9.00
% 8.81/9.00 Search stopped by max_proofs option.
% 8.81/9.00
% 8.81/9.00 ============ end of search ============
% 8.81/9.00
% 8.81/9.00 ----------- soft-scott stats ----------
% 8.81/9.00
% 8.81/9.00 true clauses given 42 (21.2%)
% 8.81/9.00 false clauses given 156
% 8.81/9.00
% 8.81/9.00 FALSE TRUE
% 8.81/9.00 7 1 0
% 8.81/9.00 9 2 0
% 8.81/9.00 10 0 2
% 8.81/9.00 11 2 3
% 8.81/9.00 12 6 7
% 8.81/9.00 13 29 10
% 8.81/9.00 14 83 30
% 8.81/9.00 15 186 17
% 8.81/9.00 16 239 34
% 8.81/9.00 17 334 16
% 8.81/9.00 18 386 23
% 8.81/9.00 19 412 16
% 8.81/9.00 20 448 34
% 8.81/9.00 21 469 23
% 8.81/9.00 22 36 4
% 8.81/9.00 23 2 6
% 8.81/9.00 24 5 11
% 8.81/9.00 25 6 10
% 8.81/9.00 26 6 2
% 8.81/9.00 27 2 6
% 8.81/9.00 28 1 2
% 8.81/9.00 29 2 7
% 8.81/9.00 30 0 1
% 8.81/9.00 31 0 4
% 8.81/9.00 32 4 1
% 8.81/9.00 33 0 1
% 8.81/9.00 34 1 0
% 8.81/9.00 35 1 2
% 8.81/9.00 37 0 1
% 8.81/9.00 39 1 1
% 8.81/9.00 40 0 1
% 8.81/9.00 42 1 0
% 8.81/9.00 49 0 1
% 8.81/9.00 tot: 2665 276 (9.4% true)
% 8.81/9.00
% 8.81/9.00
% 8.81/9.00 Model 4 [ 1 -426 289 ] (0.00 seconds, 250000 Inserts)
% 8.81/9.00
% 8.81/9.00 That finishes the proof of the theorem.
% 8.81/9.00
% 8.81/9.00 Process 9117 finished Sun Jul 3 14:13:49 2022
%------------------------------------------------------------------------------