TSTP Solution File: LCL110-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL110-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:59 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : LCL110-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 18:41:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n026.cluster.edu,
% 0.12/0.36 Sun Jul 3 18:41:06 2022
% 0.12/0.36 The command was "./sos". The process ID is 19861.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This is a Horn set without equality. The strategy will
% 0.12/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.36 in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 2
% 0.19/0.39 number of clauses initially in problem: 6
% 0.19/0.39 percentage of clauses intially in UL: 33
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 4
% 0.19/0.39 distinct predicate count: 1
% 0.19/0.39 distinct function count: 2
% 0.19/0.39 distinct constant count: 1
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.19/0.41
% 0.19/0.41 -------- PROOF --------
% 0.19/0.41 % SZS status Unsatisfiable
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41 ----> UNIT CONFLICT at 0.03 sec ----> 143 [binary,142.1,2.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 Length of proof is 8. Level of proof is 5.
% 0.19/0.41
% 0.19/0.41 ---------------- PROOF ----------------
% 0.19/0.41 % SZS status Unsatisfiable
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.19/0.41 2 [] {+} -is_a_theorem(implies(not(not(a)),a)).
% 0.19/0.41 3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 0.19/0.41 4 [] {+} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 0.19/0.41 5 [] {+} is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))).
% 0.19/0.41 6 [] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 0.19/0.41 17 [hyper,4,1,6] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(not(B),not(A)),C))).
% 0.19/0.41 18 [hyper,4,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 0.19/0.41 22 [hyper,17,1,6] {-} is_a_theorem(implies(implies(not(not(A)),not(not(B))),implies(A,B))).
% 0.19/0.41 47 [hyper,18,1,22] {-} is_a_theorem(implies(not(not(A)),implies(B,A))).
% 0.19/0.41 49 [hyper,18,1,5] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 0.19/0.41 54 [hyper,47,1,4] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(not(B)),C))).
% 0.19/0.41 65 [hyper,49,1,47] {-} is_a_theorem(implies(implies(implies(not(not(A)),implies(B,A)),C),C)).
% 0.19/0.41 142 [hyper,65,1,54] {-} is_a_theorem(implies(not(not(A)),A)).
% 0.19/0.41 143 [binary,142.1,2.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 % SZS output end Refutation
% 0.19/0.41 ------------ end of proof -------------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41 ============ end of search ============
% 0.19/0.41
% 0.19/0.41 ----------- soft-scott stats ----------
% 0.19/0.41
% 0.19/0.41 true clauses given 9 (33.3%)
% 0.19/0.41 false clauses given 18
% 0.19/0.41
% 0.19/0.41 FALSE TRUE
% 0.19/0.41 9 0 4
% 0.19/0.41 10 0 6
% 0.19/0.41 11 0 5
% 0.19/0.41 12 7 10
% 0.19/0.41 14 26 7
% 0.19/0.41 16 21 6
% 0.19/0.41 18 10 4
% 0.19/0.41 20 3 3
% 0.19/0.41 tot: 67 45 (40.2% true)
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 That finishes the proof of the theorem.
% 0.19/0.41
% 0.19/0.41 Process 19861 finished Sun Jul 3 18:41:06 2022
%------------------------------------------------------------------------------