TSTP Solution File: LCL068-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL068-1 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:42 EDT 2022
% Result : Unsatisfiable 0.91s 1.14s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LCL068-1 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.02/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n017.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 16:39:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n017.cluster.edu,
% 0.12/0.35 Mon Jul 4 16:39:42 2022
% 0.12/0.35 The command was "./sos". The process ID is 12370.
% 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.18/0.37
% 0.18/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.37
% 0.18/0.37 Stopped by limit on number of solutions
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 -------------- Softie stats --------------
% 0.18/0.37
% 0.18/0.37 UPDATE_STOP: 300
% 0.18/0.37 SFINDER_TIME_LIMIT: 2
% 0.18/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.37 number of clauses in intial UL: 2
% 0.18/0.37 number of clauses initially in problem: 5
% 0.18/0.37 percentage of clauses intially in UL: 40
% 0.18/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.37 percent of all initial clauses that are short: 100
% 0.18/0.37 absolute distinct symbol count: 4
% 0.18/0.37 distinct predicate count: 1
% 0.18/0.37 distinct function count: 2
% 0.18/0.37 distinct constant count: 1
% 0.18/0.37
% 0.18/0.37 ---------- no more Softie stats ----------
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 =========== start of search ===========
% 0.91/1.14
% 0.91/1.14 -------- PROOF --------
% 0.91/1.14 % SZS status Unsatisfiable
% 0.91/1.14 % SZS output start Refutation
% 0.91/1.14
% 0.91/1.14 Model 2 (0.00 seconds, 0 Inserts)
% 0.91/1.14
% 0.91/1.14 Stopped by limit on number of solutions
% 0.91/1.14
% 0.91/1.14 Model 3 (0.00 seconds, 0 Inserts)
% 0.91/1.14
% 0.91/1.14 Stopped by limit on number of solutions
% 0.91/1.14
% 0.91/1.14 Model 4 (0.00 seconds, 0 Inserts)
% 0.91/1.14
% 0.91/1.14 Stopped by limit on number of solutions
% 0.91/1.14
% 0.91/1.14 Model 5 [ 1 1 852 ] (0.00 seconds, 11437 Inserts)
% 0.91/1.14
% 0.91/1.14 ----> UNIT CONFLICT at 0.75 sec ----> 1418 [binary,1417.1,2.1] {-} $F.
% 0.91/1.14
% 0.91/1.14 Length of proof is 16. Level of proof is 11.
% 0.91/1.14
% 0.91/1.14 ---------------- PROOF ----------------
% 0.91/1.14 % SZS status Unsatisfiable
% 0.91/1.14 % SZS output start Refutation
% 0.91/1.14
% 0.91/1.14 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.91/1.14 2 [] {+} -is_a_theorem(implies(implies(not(a),a),a)).
% 0.91/1.14 3 [] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 0.91/1.14 4 [] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 0.91/1.14 5 [] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(C,B),implies(implies(A,C),B)))).
% 0.91/1.14 6 [hyper,3,1,3] {+} is_a_theorem(implies(A,implies(B,A))).
% 0.91/1.14 8 [hyper,6,1,3] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 0.91/1.14 12 [hyper,4,1,6] {-} is_a_theorem(implies(not(A),implies(B,implies(A,C)))).
% 0.91/1.14 17 [hyper,5,1,4] {+} is_a_theorem(implies(not(not(A)),implies(implies(B,C),implies(implies(A,B),C)))).
% 0.91/1.14 18 [hyper,5,1,12] {+} is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(implies(C,A),implies(B,implies(C,D))))).
% 0.91/1.14 27 [hyper,8,1,4] {-} is_a_theorem(implies(not(A),implies(B,implies(C,implies(A,D))))).
% 0.91/1.14 42 [hyper,27,1,5] {+} is_a_theorem(implies(implies(A,implies(B,implies(C,implies(D,E)))),implies(implies(D,A),implies(B,implies(C,implies(D,E)))))).
% 0.91/1.14 91 [hyper,18,1,6] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(A,B)))).
% 0.91/1.14 417 [hyper,91,1,6] {+} is_a_theorem(implies(A,implies(B,B))).
% 0.91/1.14 432 [hyper,417,1,417] {+} is_a_theorem(implies(A,A)).
% 0.91/1.14 504 [hyper,42,1,17] {-} is_a_theorem(implies(implies(A,not(not(B))),implies(implies(C,implies(A,D)),implies(implies(B,C),implies(A,D))))).
% 0.91/1.14 742 [hyper,504,1,432] {-} is_a_theorem(implies(implies(A,implies(not(not(B)),C)),implies(implies(B,A),implies(not(not(B)),C)))).
% 0.91/1.14 791 [hyper,742,1,6] {-} is_a_theorem(implies(implies(A,B),implies(not(not(A)),B))).
% 0.91/1.14 820 [hyper,791,1,432] {+} is_a_theorem(implies(not(not(A)),A)).
% 0.91/1.14 889 [hyper,820,1,5] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(B),A),B))).
% 0.91/1.14 1417 [hyper,889,1,432] {-} is_a_theorem(implies(implies(not(A),A),A)).
% 0.91/1.14 1418 [binary,1417.1,2.1] {-} $F.
% 0.91/1.14
% 0.91/1.14 % SZS output end Refutation
% 0.91/1.14 ------------ end of proof -------------
% 0.91/1.14
% 0.91/1.14
% 0.91/1.14 Search stopped by max_proofs option.
% 0.91/1.14
% 0.91/1.14
% 0.91/1.14 Search stopped by max_proofs option.
% 0.91/1.14
% 0.91/1.14 ============ end of search ============
% 0.91/1.14
% 0.91/1.14 ----------- soft-scott stats ----------
% 0.91/1.14
% 0.91/1.14 true clauses given 40 (30.3%)
% 0.91/1.14 false clauses given 92
% 0.91/1.14
% 0.91/1.14 FALSE TRUE
% 0.91/1.14 9 0 9
% 0.91/1.14 10 0 36
% 0.91/1.14 11 0 44
% 0.91/1.14 12 18 61
% 0.91/1.14 13 4 62
% 0.91/1.14 14 23 120
% 0.91/1.14 15 8 125
% 0.91/1.14 16 21 108
% 0.91/1.14 17 5 96
% 0.91/1.14 18 15 77
% 0.91/1.14 19 3 38
% 0.91/1.14 20 15 49
% 0.91/1.14 21 11 35
% 0.91/1.14 22 27 45
% 0.91/1.14 23 7 17
% 0.91/1.14 24 36 35
% 0.91/1.14 25 6 16
% 0.91/1.14 26 14 15
% 0.91/1.14 27 5 3
% 0.91/1.14 28 11 7
% 0.91/1.14 29 2 0
% 0.91/1.14 30 1 2
% 0.91/1.14 31 1 0
% 0.91/1.14 33 1 0
% 0.91/1.14 35 1 0
% 0.91/1.14 37 1 0
% 0.91/1.14 tot: 236 1000 (80.9% true)
% 0.91/1.14
% 0.91/1.14
% 0.91/1.14 Model 5 [ 1 1 852 ] (0.00 seconds, 11437 Inserts)
% 0.91/1.14
% 0.91/1.14 That finishes the proof of the theorem.
% 0.91/1.14
% 0.91/1.14 Process 12370 finished Mon Jul 4 16:39:43 2022
%------------------------------------------------------------------------------