TSTP Solution File: LCL076-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL076-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.35s 0.54s
% Output : Refutation 0.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LCL076-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.32 % Computer : n013.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jul 3 15:00:59 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox2 on n013.cluster.edu,
% 0.12/0.34 Sun Jul 3 15:00:59 2022
% 0.12/0.34 The command was "./sos". The process ID is 31097.
% 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: 100
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 4
% 0.12/0.37 distinct predicate count: 1
% 0.12/0.37 distinct function count: 2
% 0.12/0.37 distinct constant count: 1
% 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 Model 2 (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 =========== start of search ===========
% 0.35/0.54
% 0.35/0.54 -------- PROOF --------
% 0.35/0.54 % SZS status Unsatisfiable
% 0.35/0.54 % SZS output start Refutation
% 0.35/0.54
% 0.35/0.54 Model 3 (0.00 seconds, 0 Inserts)
% 0.35/0.54
% 0.35/0.54 Stopped by limit on number of solutions
% 0.35/0.54
% 0.35/0.54 ----> UNIT CONFLICT at 0.18 sec ----> 95 [binary,94.1,2.1] {-} $F.
% 0.35/0.54
% 0.35/0.54 Length of proof is 15. Level of proof is 9.
% 0.35/0.54
% 0.35/0.54 ---------------- PROOF ----------------
% 0.35/0.54 % SZS status Unsatisfiable
% 0.35/0.54 % SZS output start Refutation
% 0.35/0.54
% 0.35/0.54 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.35/0.54 2 [] {+} -is_a_theorem(implies(a,not(not(a)))).
% 0.35/0.54 3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 0.35/0.54 4 [] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 0.35/0.54 5 [] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 0.35/0.54 7 [hyper,5,1,3] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 0.35/0.54 8 [hyper,7,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(not(C),not(D)),implies(D,C))))).
% 0.35/0.54 13 [hyper,4,1,7] {-} is_a_theorem(implies(implies(A,implies(not(B),not(C))),implies(A,implies(C,B)))).
% 0.35/0.54 15 [hyper,4,1,5] {-} is_a_theorem(implies(implies(implies(not(A),not(B)),B),implies(implies(not(A),not(B)),A))).
% 0.35/0.54 16 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(A,A))).
% 0.35/0.54 19 [hyper,13,1,5] {-} is_a_theorem(implies(implies(not(not(A)),not(not(B))),implies(A,B))).
% 0.35/0.54 20 [hyper,13,1,3] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 0.35/0.54 28 [hyper,16,1,8] {+} is_a_theorem(implies(A,A)).
% 0.35/0.54 29 [hyper,19,1,13] {-} is_a_theorem(implies(implies(not(not(not(A))),not(not(not(B)))),implies(B,A))).
% 0.35/0.54 37 [hyper,28,1,3] {+} is_a_theorem(implies(A,implies(B,B))).
% 0.35/0.54 49 [hyper,37,1,15] {-} is_a_theorem(implies(implies(not(A),not(implies(B,B))),A)).
% 0.35/0.54 53 [hyper,49,1,3] {-} is_a_theorem(implies(A,implies(implies(not(B),not(implies(C,C))),B))).
% 0.35/0.54 58 [hyper,53,1,4] {-} is_a_theorem(implies(implies(A,implies(not(B),not(implies(C,C)))),implies(A,B))).
% 0.35/0.54 86 [hyper,58,1,20] {+} is_a_theorem(implies(not(not(A)),A)).
% 0.35/0.54 94 [hyper,86,1,29] {-} is_a_theorem(implies(A,not(not(A)))).
% 0.35/0.54 95 [binary,94.1,2.1] {-} $F.
% 0.35/0.54
% 0.35/0.54 % SZS output end Refutation
% 0.35/0.54 ------------ end of proof -------------
% 0.35/0.54
% 0.35/0.54
% 0.35/0.54 Search stopped by max_proofs option.
% 0.35/0.54
% 0.35/0.54
% 0.35/0.54 Search stopped by max_proofs option.
% 0.35/0.54
% 0.35/0.54 ============ end of search ============
% 0.35/0.54
% 0.35/0.54 ----------- soft-scott stats ----------
% 0.35/0.54
% 0.35/0.54 true clauses given 8 (32.0%)
% 0.35/0.54 false clauses given 17
% 0.35/0.54
% 0.35/0.54 FALSE TRUE
% 0.35/0.54 7 0 1
% 0.35/0.54 8 0 2
% 0.35/0.54 9 0 1
% 0.35/0.54 10 0 3
% 0.35/0.54 12 1 3
% 0.35/0.54 14 2 1
% 0.35/0.54 16 16 1
% 0.35/0.54 18 8 0
% 0.35/0.54 20 6 0
% 0.35/0.54 22 3 1
% 0.35/0.54 24 5 0
% 0.35/0.54 26 1 0
% 0.35/0.54 28 1 0
% 0.35/0.54 30 0 1
% 0.35/0.54 32 1 0
% 0.35/0.54 tot: 44 14 (24.1% true)
% 0.35/0.54
% 0.35/0.54
% 0.35/0.54 Model 3 (0.00 seconds, 0 Inserts)
% 0.35/0.54
% 0.35/0.54 That finishes the proof of the theorem.
% 0.35/0.54
% 0.35/0.54 Process 31097 finished Sun Jul 3 15:01:00 2022
%------------------------------------------------------------------------------