TSTP Solution File: LCL367-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL367-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:44 EDT 2022
% Result : Unsatisfiable 1.65s 1.82s
% Output : Refutation 1.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL367-1 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n028.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 : Mon Jul 4 20:16:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox on n028.cluster.edu,
% 0.12/0.34 Mon Jul 4 20:16:35 2022
% 0.12/0.34 The command was "./sos". The process ID is 12284.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.34
% 0.12/0.34 This is a Horn set without equality. The strategy will
% 0.12/0.34 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.34 in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: clear(order_hyper).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 2
% 0.12/0.37 number of clauses initially in problem: 5
% 0.12/0.37 percentage of clauses intially in UL: 40
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 80
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 5
% 0.12/0.37 distinct predicate count: 1
% 0.12/0.37 distinct function count: 2
% 0.12/0.37 distinct constant count: 2
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 1.65/1.82
% 1.65/1.82 -------- PROOF --------
% 1.65/1.82 % SZS status Unsatisfiable
% 1.65/1.82 % SZS output start Refutation
% 1.65/1.82
% 1.65/1.82 Model 2 (0.00 seconds, 0 Inserts)
% 1.65/1.82
% 1.65/1.82 Stopped by limit on number of solutions
% 1.65/1.82
% 1.65/1.82 Model 3 (0.00 seconds, 0 Inserts)
% 1.65/1.82
% 1.65/1.82 Stopped by limit on number of solutions
% 1.65/1.82
% 1.65/1.82 Model 4 [ 1 0 123 ] (0.00 seconds, 224709 Inserts)
% 1.65/1.82
% 1.65/1.82 Model 5 [ 1 0 206 ] (0.00 seconds, 114256 Inserts)
% 1.65/1.82
% 1.65/1.82 Model 6 [ 1 0 328 ] (0.00 seconds, 185125 Inserts)
% 1.65/1.82
% 1.65/1.82 Model 7 [ 4 0 338 ] (0.00 seconds, 77015 Inserts)
% 1.65/1.82
% 1.65/1.82 ----> UNIT CONFLICT at 1.45 sec ----> 858 [binary,857.1,2.1] {-} $F.
% 1.65/1.82
% 1.65/1.82 Length of proof is 17. Level of proof is 12.
% 1.65/1.82
% 1.65/1.82 ---------------- PROOF ----------------
% 1.65/1.82 % SZS status Unsatisfiable
% 1.65/1.82 % SZS output start Refutation
% 1.65/1.82
% 1.65/1.82 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.65/1.82 2 [] {+} -is_a_theorem(implies(x,implies(implies(y,x),x))).
% 1.65/1.82 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 1.65/1.82 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 1.65/1.82 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 1.65/1.82 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 1.65/1.82 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 1.65/1.82 15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 1.65/1.82 17 [hyper,15,1,5] {+} is_a_theorem(implies(not(implies(A,A)),B)).
% 1.65/1.82 18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 1.65/1.82 21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 1.65/1.82 81 [hyper,21,1,9] {-} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 1.65/1.82 86 [hyper,21,1,17] {-} is_a_theorem(implies(A,implies(not(implies(B,B)),C))).
% 1.65/1.82 98 [hyper,81,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 1.65/1.82 112 [hyper,86,1,3] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 1.65/1.82 426 [hyper,112,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 1.65/1.82 432 [hyper,426,1,18] {+} is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))).
% 1.65/1.82 474 [hyper,432,1,4] {-} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 1.65/1.82 531 [hyper,474,1,18] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 1.65/1.82 766 [hyper,531,1,98] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 1.65/1.82 789 [hyper,766,1,531] {-} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 1.65/1.82 857 [hyper,789,1,789] {-} is_a_theorem(implies(A,implies(B,A))).
% 1.65/1.82 858 [binary,857.1,2.1] {-} $F.
% 1.65/1.82
% 1.65/1.82 % SZS output end Refutation
% 1.65/1.82 ------------ end of proof -------------
% 1.65/1.82
% 1.65/1.82
% 1.65/1.82 Search stopped by max_proofs option.
% 1.65/1.82
% 1.65/1.82
% 1.65/1.82 Search stopped by max_proofs option.
% 1.65/1.82
% 1.65/1.82 ============ end of search ============
% 1.65/1.82
% 1.65/1.82 ----------- soft-scott stats ----------
% 1.65/1.82
% 1.65/1.82 true clauses given 11 (17.2%)
% 1.65/1.82 false clauses given 53
% 1.65/1.82
% 1.65/1.82 FALSE TRUE
% 1.65/1.82 10 1 2
% 1.65/1.82 11 2 6
% 1.65/1.82 12 1 8
% 1.65/1.82 13 14 11
% 1.65/1.82 14 27 14
% 1.65/1.82 15 36 19
% 1.65/1.82 16 46 22
% 1.65/1.82 17 49 29
% 1.65/1.82 18 36 26
% 1.65/1.82 19 47 20
% 1.65/1.82 20 52 23
% 1.65/1.82 21 56 21
% 1.65/1.82 22 25 16
% 1.65/1.82 23 29 12
% 1.65/1.82 24 17 7
% 1.65/1.82 25 18 4
% 1.65/1.82 26 4 4
% 1.65/1.82 27 13 1
% 1.65/1.82 28 4 1
% 1.65/1.82 29 15 0
% 1.65/1.82 30 1 0
% 1.65/1.82 31 14 0
% 1.65/1.82 33 1 0
% 1.65/1.82 35 3 0
% 1.65/1.82 37 4 0
% 1.65/1.82 41 1 0
% 1.65/1.82 43 1 0
% 1.65/1.82 45 1 0
% 1.65/1.82 tot: 518 246 (32.2% true)
% 1.65/1.82
% 1.65/1.82
% 1.65/1.82 Model 7 [ 4 -23 338 ] (0.00 seconds, 77015 Inserts)
% 1.65/1.82
% 1.65/1.82 That finishes the proof of the theorem.
% 1.65/1.82
% 1.65/1.82 Process 12284 finished Mon Jul 4 20:16:36 2022
%------------------------------------------------------------------------------