TSTP Solution File: LCL080-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL080-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:27:47 EDT 2022
% Result : Unsatisfiable 18.05s 18.29s
% Output : Refutation 18.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL080-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 14:16:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n014.cluster.edu,
% 0.12/0.35 Sat Jul 2 14:16:25 2022
% 0.12/0.35 The command was "./sos". The process ID is 4356.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 2
% 0.12/0.39 number of clauses initially in problem: 6
% 0.12/0.39 percentage of clauses intially in UL: 33
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 6
% 0.12/0.39 distinct predicate count: 1
% 0.12/0.39 distinct function count: 1
% 0.12/0.39 distinct constant count: 4
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 18.05/18.29
% 18.05/18.29 -- HEY sandbox, WE HAVE A PROOF!! --
% 18.05/18.29
% 18.05/18.29 Stopped by limit on insertions
% 18.05/18.29
% 18.05/18.29 Model 3 (0.00 seconds, 0 Inserts)
% 18.05/18.29
% 18.05/18.29 Stopped by limit on number of solutions
% 18.05/18.29
% 18.05/18.29 Stopped by limit on insertions
% 18.05/18.29
% 18.05/18.29 Model 4 [ 1 1 2824 ] (0.00 seconds, 250000 Inserts)
% 18.05/18.29
% 18.05/18.29 Stopped by limit on insertions
% 18.05/18.29
% 18.05/18.29 Model 5 [ 1 3 7344 ] (0.00 seconds, 250000 Inserts)
% 18.05/18.29
% 18.05/18.29 Stopped by limit on insertions
% 18.05/18.29
% 18.05/18.29 Model 6 [ 1 0 474 ] (0.00 seconds, 250000 Inserts)
% 18.05/18.29
% 18.05/18.29 ----> UNIT CONFLICT at 17.91 sec ----> 1185 [binary,1184.1,2.1] {-} $F.
% 18.05/18.29
% 18.05/18.29 Length of proof is 13. Level of proof is 8.
% 18.05/18.29
% 18.05/18.29 ---------------- PROOF ----------------
% 18.05/18.29 % SZS status Unsatisfiable
% 18.05/18.29 % SZS output start Refutation
% 18.05/18.29
% 18.05/18.29 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 18.05/18.29 2 [] {+} -is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))).
% 18.05/18.29 4 [] {-} is_a_theorem(implies(A,implies(B,A))).
% 18.05/18.29 5 [] {+} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 18.05/18.29 6 [] {+} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 18.05/18.29 10 [hyper,5,1,4] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 18.05/18.29 12 [hyper,6,1,6] {+} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 18.05/18.29 16 [hyper,6,1,5] {-} is_a_theorem(implies(implies(A,B),implies(implies(implies(A,C),A),B))).
% 18.05/18.29 18 [hyper,10,1,6] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),implies(D,C))).
% 18.05/18.29 25 [hyper,16,1,4] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))).
% 18.05/18.29 30 [hyper,25,1,4] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(D,B)))).
% 18.05/18.29 53 [hyper,12,1,5] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 18.05/18.29 58 [hyper,53,1,18] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),C)).
% 18.05/18.29 61 [hyper,58,1,12] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,B))).
% 18.05/18.29 66 [hyper,61,1,12] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))).
% 18.05/18.29 82 [hyper,66,1,30] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),A),implies(C,A)),D),D)).
% 18.05/18.29 366 [hyper,82,1,12] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,implies(D,B)))).
% 18.05/18.29 1184 [hyper,366,1,12] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))).
% 18.05/18.29 1185 [binary,1184.1,2.1] {-} $F.
% 18.05/18.29
% 18.05/18.29 % SZS output end Refutation
% 18.05/18.29 ------------ end of proof -------------
% 18.05/18.29
% 18.05/18.29
% 18.05/18.29 Search stopped by max_proofs option.
% 18.05/18.29
% 18.05/18.29
% 18.05/18.29 Search stopped by max_proofs option.
% 18.05/18.29
% 18.05/18.29 ============ end of search ============
% 18.05/18.29
% 18.05/18.29 ----------- soft-scott stats ----------
% 18.05/18.29
% 18.05/18.29 true clauses given 28 (27.5%)
% 18.05/18.29 false clauses given 74
% 18.05/18.29
% 18.05/18.29 FALSE TRUE
% 18.05/18.29 12 0 33
% 18.05/18.29 14 21 71
% 18.05/18.29 16 129 97
% 18.05/18.29 18 182 42
% 18.05/18.29 20 205 19
% 18.05/18.29 22 79 8
% 18.05/18.29 24 71 2
% 18.05/18.29 26 24 0
% 18.05/18.29 28 21 0
% 18.05/18.29 30 28 0
% 18.05/18.29 32 15 0
% 18.05/18.29 34 4 0
% 18.05/18.29 36 4 0
% 18.05/18.29 48 1 0
% 18.05/18.29 50 1 0
% 18.05/18.29 52 2 0
% 18.05/18.29 tot: 787 272 (25.7% true)
% 18.05/18.29
% 18.05/18.29
% 18.05/18.29 Model 6 [ 1 0 474 ] (0.00 seconds, 250000 Inserts)
% 18.05/18.29
% 18.05/18.29 That finishes the proof of the theorem.
% 18.05/18.29
% 18.05/18.29 Process 4356 finished Sat Jul 2 14:16:43 2022
%------------------------------------------------------------------------------