TSTP Solution File: LCL064-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL064-2 : TPTP v8.1.0. Released v1.0.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:27:41 EDT 2022
% Result : Unsatisfiable 13.89s 14.05s
% Output : Refutation 13.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : LCL064-2 : TPTP v8.1.0. Released v1.0.0.
% 0.01/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n011.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 : Sun Jul 3 18:33:35 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.35 ----- Otter 3.2, August 2001 -----
% 0.20/0.35 The process was started by sandbox2 on n011.cluster.edu,
% 0.20/0.35 Sun Jul 3 18:33:35 2022
% 0.20/0.35 The command was "./sos". The process ID is 19387.
% 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: 4
% 0.20/0.39 percentage of clauses intially in UL: 50
% 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: 5
% 0.20/0.39 distinct predicate count: 1
% 0.20/0.39 distinct function count: 1
% 0.20/0.39 distinct constant count: 3
% 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 ===========
% 13.89/14.05
% 13.89/14.05 -- HEY sandbox2, WE HAVE A PROOF!! --
% 13.89/14.05
% 13.89/14.05 Model 3 (0.00 seconds, 0 Inserts)
% 13.89/14.05
% 13.89/14.05 Stopped by limit on number of solutions
% 13.89/14.05
% 13.89/14.05 Model 4 [ 1 0 553 ] (0.00 seconds, 185012 Inserts)
% 13.89/14.05
% 13.89/14.05 Model 5 [ 3 1 1933 ] (0.00 seconds, 186874 Inserts)
% 13.89/14.05
% 13.89/14.05 Model 6 [ 3 326 189789 ] (0.00 seconds, 194486 Inserts)
% 13.89/14.05
% 13.89/14.05 ----> UNIT CONFLICT at 13.67 sec ----> 1316 [binary,1315.1,2.1] {-} $F.
% 13.89/14.05
% 13.89/14.05 Length of proof is 16. Level of proof is 10.
% 13.89/14.05
% 13.89/14.05 ---------------- PROOF ----------------
% 13.89/14.05 % SZS status Unsatisfiable
% 13.89/14.05 % SZS output start Refutation
% 13.89/14.05
% 13.89/14.05 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 13.89/14.05 2 [] {+} -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))).
% 13.89/14.05 3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 13.89/14.05 4 [] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 13.89/14.05 5 [hyper,3,1,3] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 13.89/14.05 6 [hyper,4,1,4] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))).
% 13.89/14.05 7 [hyper,4,1,3] {-} is_a_theorem(implies(A,implies(implies(B,implies(C,D)),implies(implies(B,C),implies(B,D))))).
% 13.89/14.05 8 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(A,A))).
% 13.89/14.05 11 [hyper,8,1,3] {+} is_a_theorem(implies(A,A)).
% 13.89/14.05 12 [hyper,7,1,4] {-} is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(A,implies(implies(B,C),implies(B,D))))).
% 13.89/14.05 14 [hyper,11,1,4] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(implies(A,B),B))).
% 13.89/14.05 21 [hyper,14,1,5] {-} is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)).
% 13.89/14.05 23 [hyper,21,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,implies(C,B)),D),D))).
% 13.89/14.05 31 [hyper,6,1,7] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(implies(implies(A,B),implies(A,C)),D)),implies(implies(A,implies(B,C)),D))).
% 13.89/14.05 61 [hyper,12,1,21] {-} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 13.89/14.05 84 [hyper,23,1,4] {-} is_a_theorem(implies(implies(A,implies(implies(B,implies(C,B)),D)),implies(A,D))).
% 13.89/14.05 953 [hyper,84,1,61] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 13.89/14.05 972 [hyper,953,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),D),implies(C,D)))).
% 13.89/14.05 1085 [hyper,972,1,31] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 13.89/14.05 1315 [hyper,1085,1,61] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 13.89/14.05 1316 [binary,1315.1,2.1] {-} $F.
% 13.89/14.05
% 13.89/14.05 % SZS output end Refutation
% 13.89/14.05 ------------ end of proof -------------
% 13.89/14.05
% 13.89/14.05
% 13.89/14.05 Search stopped by max_proofs option.
% 13.89/14.05
% 13.89/14.05
% 13.89/14.05 Search stopped by max_proofs option.
% 13.89/14.05
% 13.89/14.05 ============ end of search ============
% 13.89/14.05
% 13.89/14.05 ----------- soft-scott stats ----------
% 13.89/14.05
% 13.89/14.05 true clauses given 11 (13.3%)
% 13.89/14.05 false clauses given 72
% 13.89/14.05
% 13.89/14.05 FALSE TRUE
% 13.89/14.05 12 0 9
% 13.89/14.05 14 81 22
% 13.89/14.05 16 193 24
% 13.89/14.05 18 224 23
% 13.89/14.05 20 261 18
% 13.89/14.05 22 94 6
% 13.89/14.05 24 53 3
% 13.89/14.05 26 52 5
% 13.89/14.05 28 40 1
% 13.89/14.05 30 27 2
% 13.89/14.05 32 17 1
% 13.89/14.05 34 11 0
% 13.89/14.05 36 7 0
% 13.89/14.05 38 9 0
% 13.89/14.05 40 4 0
% 13.89/14.05 42 3 0
% 13.89/14.05 46 1 0
% 13.89/14.05 48 1 0
% 13.89/14.05 50 1 0
% 13.89/14.05 tot: 1079 114 (9.6% true)
% 13.89/14.05
% 13.89/14.05
% 13.89/14.05 Model 6 [ 3 326 189789 ] (0.00 seconds, 194486 Inserts)
% 13.89/14.05
% 13.89/14.05 That finishes the proof of the theorem.
% 13.89/14.05
% 13.89/14.05 Process 19387 finished Sun Jul 3 18:33:49 2022
%------------------------------------------------------------------------------