TSTP Solution File: LCL075-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL075-1 : TPTP v8.1.0. Released v1.0.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:27:44 EDT 2022
% Result : Unsatisfiable 0.59s 0.80s
% Output : Refutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL075-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 15:59:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n013.cluster.edu,
% 0.13/0.37 Sun Jul 3 15:59:59 2022
% 0.13/0.37 The command was "./sos". The process ID is 8560.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.37
% 0.13/0.37 This is a Horn set without equality. The strategy will
% 0.13/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.37 in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: clear(order_hyper).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.21/0.39
% 0.21/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.39
% 0.21/0.39 Stopped by limit on number of solutions
% 0.21/0.39
% 0.21/0.39
% 0.21/0.39 -------------- Softie stats --------------
% 0.21/0.39
% 0.21/0.39 UPDATE_STOP: 300
% 0.21/0.39 SFINDER_TIME_LIMIT: 2
% 0.21/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.39 number of clauses in intial UL: 2
% 0.21/0.39 number of clauses initially in problem: 3
% 0.21/0.39 percentage of clauses intially in UL: 66
% 0.21/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.39 percent of all initial clauses that are short: 100
% 0.21/0.39 absolute distinct symbol count: 5
% 0.21/0.39 distinct predicate count: 1
% 0.21/0.39 distinct function count: 2
% 0.21/0.39 distinct constant count: 2
% 0.21/0.39
% 0.21/0.39 ---------- no more Softie stats ----------
% 0.21/0.39
% 0.21/0.39
% 0.21/0.39
% 0.21/0.39 =========== start of search ===========
% 0.59/0.80
% 0.59/0.80 -------- PROOF --------
% 0.59/0.80 % SZS status Unsatisfiable
% 0.59/0.80 % SZS output start Refutation
% 0.59/0.80
% 0.59/0.80 Model 2 (0.00 seconds, 0 Inserts)
% 0.59/0.80
% 0.59/0.80 Stopped by limit on number of solutions
% 0.59/0.80
% 0.59/0.80 Model 3 (0.00 seconds, 0 Inserts)
% 0.59/0.80
% 0.59/0.80 Stopped by limit on number of solutions
% 0.59/0.80
% 0.59/0.80 Model 4 (0.00 seconds, 0 Inserts)
% 0.59/0.80
% 0.59/0.80 Stopped by limit on number of solutions
% 0.59/0.80
% 0.59/0.80 Model 5 (0.00 seconds, 0 Inserts)
% 0.59/0.80
% 0.59/0.80 Stopped by limit on number of solutions
% 0.59/0.80
% 0.59/0.80 ----> UNIT CONFLICT at 0.41 sec ----> 675 [binary,674.1,2.1] {-} $F.
% 0.59/0.80
% 0.59/0.80 Length of proof is 8. Level of proof is 8.
% 0.59/0.80
% 0.59/0.80 ---------------- PROOF ----------------
% 0.59/0.80 % SZS status Unsatisfiable
% 0.59/0.80 % SZS output start Refutation
% 0.59/0.80
% 0.59/0.80 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.59/0.80 2 [] {+} -is_a_theorem(implies(a,implies(not(a),b))).
% 0.59/0.80 3 [] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),implies(not(C),not(D))),C),E),implies(implies(E,A),implies(D,A)))).
% 0.59/0.80 4 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))).
% 0.59/0.80 6 [hyper,4,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 0.59/0.80 15 [hyper,6,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 0.59/0.80 35 [hyper,15,1,15] {+} is_a_theorem(implies(A,implies(B,implies(C,C)))).
% 0.59/0.80 47 [hyper,35,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,B)),C),implies(D,C))).
% 0.59/0.80 88 [hyper,47,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 0.59/0.80 97 [hyper,88,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),not(B)),A),C),implies(B,C))).
% 0.59/0.80 674 [hyper,97,1,88] {-} is_a_theorem(implies(A,implies(not(A),B))).
% 0.59/0.80 675 [binary,674.1,2.1] {-} $F.
% 0.59/0.80
% 0.59/0.80 % SZS output end Refutation
% 0.59/0.80 ------------ end of proof -------------
% 0.59/0.80
% 0.59/0.80
% 0.59/0.80 Search stopped by max_proofs option.
% 0.59/0.80
% 0.59/0.80
% 0.59/0.80 Search stopped by max_proofs option.
% 0.59/0.80
% 0.59/0.80 ============ end of search ============
% 0.59/0.80
% 0.59/0.80 ----------- soft-scott stats ----------
% 0.59/0.80
% 0.59/0.80 true clauses given 9 (17.3%)
% 0.59/0.80 false clauses given 43
% 0.59/0.80
% 0.59/0.80 FALSE TRUE
% 0.59/0.80 11 0 2
% 0.59/0.80 12 0 6
% 0.59/0.80 13 0 6
% 0.59/0.80 14 11 6
% 0.59/0.80 15 22 11
% 0.59/0.80 16 26 10
% 0.59/0.80 17 34 15
% 0.59/0.80 18 40 9
% 0.59/0.80 19 52 16
% 0.59/0.80 20 45 7
% 0.59/0.80 21 49 2
% 0.59/0.80 22 53 0
% 0.59/0.81 23 20 3
% 0.59/0.81 24 13 0
% 0.59/0.81 25 9 1
% 0.59/0.81 26 4 0
% 0.59/0.81 27 17 4
% 0.59/0.81 28 6 0
% 0.59/0.81 29 9 1
% 0.59/0.81 30 5 0
% 0.59/0.81 31 15 0
% 0.59/0.81 32 9 0
% 0.59/0.81 33 12 0
% 0.59/0.81 35 2 0
% 0.59/0.81 37 2 0
% 0.59/0.81 43 2 0
% 0.59/0.81 51 1 0
% 0.59/0.81 53 2 0
% 0.59/0.81 tot: 460 99 (17.7% true)
% 0.59/0.81
% 0.59/0.81
% 0.59/0.81 Model 5 (0.00 seconds, 0 Inserts)
% 0.59/0.81
% 0.59/0.81 That finishes the proof of the theorem.
% 0.59/0.81
% 0.59/0.81 Process 8560 finished Sun Jul 3 16:00:00 2022
%------------------------------------------------------------------------------