TSTP Solution File: LCL361-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL361-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:29:42 EDT 2022
% Result : Unsatisfiable 3.87s 4.05s
% Output : Refutation 3.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL361-1 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n011.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 19:11:51 EDT 2022
% 0.20/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox2 on n011.cluster.edu,
% 0.20/0.36 Sun Jul 3 19:11:51 2022
% 0.20/0.36 The command was "./sos". The process ID is 30422.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.20/0.36
% 0.20/0.36 This is a Horn set without equality. The strategy will
% 0.20/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.20/0.36 in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: clear(order_hyper).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 2
% 0.20/0.38 number of clauses initially in problem: 5
% 0.20/0.38 percentage of clauses intially in UL: 40
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 5
% 0.20/0.38 distinct predicate count: 1
% 0.20/0.38 distinct function count: 2
% 0.20/0.38 distinct constant count: 2
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 3.87/4.05
% 3.87/4.05 -------- PROOF --------
% 3.87/4.05 % SZS status Unsatisfiable
% 3.87/4.05 % SZS output start Refutation
% 3.87/4.05
% 3.87/4.05 Model 2 (0.00 seconds, 0 Inserts)
% 3.87/4.05
% 3.87/4.05 Stopped by limit on number of solutions
% 3.87/4.05
% 3.87/4.05 Model 3 (0.00 seconds, 0 Inserts)
% 3.87/4.05
% 3.87/4.05 Stopped by limit on number of solutions
% 3.87/4.05
% 3.87/4.05 Stopped by limit on insertions
% 3.87/4.05
% 3.87/4.05 Model 4 [ 1 1 59 ] (0.00 seconds, 250000 Inserts)
% 3.87/4.05
% 3.87/4.05 Stopped by limit on insertions
% 3.87/4.05
% 3.87/4.05 Model 5 [ 1 0 589 ] (0.00 seconds, 250000 Inserts)
% 3.87/4.05
% 3.87/4.05 ----> UNIT CONFLICT at 3.65 sec ----> 259 [binary,258.1,2.1] {-} $F.
% 3.87/4.05
% 3.87/4.05 Length of proof is 6. Level of proof is 5.
% 3.87/4.05
% 3.87/4.05 ---------------- PROOF ----------------
% 3.87/4.05 % SZS status Unsatisfiable
% 3.87/4.05 % SZS output start Refutation
% 3.87/4.05
% 3.87/4.05 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 3.87/4.05 2 [] {+} -is_a_theorem(implies(x,implies(implies(implies(not(x),x),x),implies(implies(y,x),x)))).
% 3.87/4.05 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 3.87/4.05 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 3.87/4.05 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 3.87/4.05 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 3.87/4.05 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 3.87/4.05 64 [hyper,29,1,9] {-} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 3.87/4.05 78 [hyper,64,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 3.87/4.05 258 [hyper,78,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 3.87/4.05 259 [binary,258.1,2.1] {-} $F.
% 3.87/4.05
% 3.87/4.05 % SZS output end Refutation
% 3.87/4.05 ------------ end of proof -------------
% 3.87/4.05
% 3.87/4.05
% 3.87/4.05 Search stopped by max_proofs option.
% 3.87/4.05
% 3.87/4.05
% 3.87/4.05 Search stopped by max_proofs option.
% 3.87/4.05
% 3.87/4.05 ============ end of search ============
% 3.87/4.05
% 3.87/4.05 ----------- soft-scott stats ----------
% 3.87/4.05
% 3.87/4.05 true clauses given 5 (14.7%)
% 3.87/4.05 false clauses given 29
% 3.87/4.05
% 3.87/4.05 FALSE TRUE
% 3.87/4.05 13 1 4
% 3.87/4.05 14 10 0
% 3.87/4.05 15 20 0
% 3.87/4.05 16 20 2
% 3.87/4.05 17 19 2
% 3.87/4.05 18 17 1
% 3.87/4.05 19 14 6
% 3.87/4.05 20 15 2
% 3.87/4.05 21 16 1
% 3.87/4.05 22 7 1
% 3.87/4.05 23 5 1
% 3.87/4.05 24 3 1
% 3.87/4.05 25 5 4
% 3.87/4.05 26 0 1
% 3.87/4.05 27 4 1
% 3.87/4.05 29 8 0
% 3.87/4.05 31 5 0
% 3.87/4.05 33 0 1
% 3.87/4.05 35 1 1
% 3.87/4.05 37 1 1
% 3.87/4.05 tot: 171 30 (14.9% true)
% 3.87/4.05
% 3.87/4.05
% 3.87/4.05 Model 5 [ 1 0 589 ] (0.00 seconds, 250000 Inserts)
% 3.87/4.05
% 3.87/4.05 That finishes the proof of the theorem.
% 3.87/4.05
% 3.87/4.05 Process 30422 finished Sun Jul 3 19:11:54 2022
%------------------------------------------------------------------------------