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