TSTP Solution File: LCL055-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL055-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:37 EDT 2022
% Result : Unsatisfiable 9.14s 9.38s
% Output : Refutation 9.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL055-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n015.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 13:20:00 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 sandbox on n015.cluster.edu,
% 0.12/0.36 Sun Jul 3 13:20:00 2022
% 0.12/0.36 The command was "./sos". The process ID is 2124.
% 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.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 2
% 0.12/0.38 number of clauses initially in problem: 5
% 0.12/0.38 percentage of clauses intially in UL: 40
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 6
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 2
% 0.12/0.38 distinct constant count: 3
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 3.24/3.50
% 3.24/3.50
% 3.24/3.50 Changing weight limit from 60 to 49.
% 3.24/3.50
% 3.24/3.50 Model 2 (0.00 seconds, 0 Inserts)
% 3.24/3.50
% 3.24/3.50 Stopped by limit on number of solutions
% 3.24/3.50
% 3.24/3.50 Model 3 (0.00 seconds, 0 Inserts)
% 3.24/3.50
% 3.24/3.50 Stopped by limit on number of solutions
% 3.24/3.50
% 3.24/3.50 Model 4 (0.00 seconds, 0 Inserts)
% 3.24/3.50
% 3.24/3.50 Stopped by limit on number of solutions
% 3.24/3.50
% 3.24/3.50 Stopped by limit on insertions
% 3.24/3.50
% 3.24/3.50 Model 5 [ 1 0 725 ] (0.00 seconds, 250000 Inserts)
% 3.24/3.50
% 3.24/3.50 Resetting weight limit to 49 after 145 givens.
% 3.24/3.50
% 9.14/9.38
% 9.14/9.38 -------- PROOF --------
% 9.14/9.38 % SZS status Unsatisfiable
% 9.14/9.38 % SZS output start Refutation
% 9.14/9.38
% 9.14/9.38 Stopped by limit on insertions
% 9.14/9.38
% 9.14/9.38 Stopped by limit on insertions
% 9.14/9.38
% 9.14/9.38 Model 6 [ 1 1 1683 ] (0.00 seconds, 250000 Inserts)
% 9.14/9.38
% 9.14/9.38 ----> UNIT CONFLICT at 8.98 sec ----> 5074 [binary,5073.1,2.1] {-} $F.
% 9.14/9.38
% 9.14/9.38 Length of proof is 25. Level of proof is 16.
% 9.14/9.38
% 9.14/9.38 ---------------- PROOF ----------------
% 9.14/9.38 % SZS status Unsatisfiable
% 9.14/9.38 % SZS output start Refutation
% 9.14/9.38
% 9.14/9.38 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 9.14/9.38 2 [] {+} -is_a_theorem(implies(implies(implies(a,b),c),implies(not(a),c))).
% 9.14/9.38 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 9.14/9.38 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 9.14/9.38 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 9.14/9.38 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 9.14/9.38 7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 9.14/9.38 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 9.14/9.38 15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 9.14/9.38 18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 9.14/9.38 21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 9.14/9.38 24 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 9.14/9.38 26 [hyper,21,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 9.14/9.38 42 [hyper,7,1,9] {-} is_a_theorem(implies(implies(not(implies(implies(not(A),B),C)),implies(implies(not(A),B),C)),implies(A,C))).
% 9.14/9.38 55 [hyper,24,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 9.14/9.38 71 [hyper,55,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 9.14/9.38 85 [hyper,71,1,15] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 9.14/9.38 111 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 9.14/9.38 162 [hyper,111,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 9.14/9.38 198 [hyper,162,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 9.14/9.38 203 [hyper,162,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 9.14/9.38 437 [hyper,203,1,18] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 9.14/9.38 4075 [hyper,437,1,26] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 9.14/9.38 4139 [hyper,4075,1,437] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 9.14/9.38 4210 [hyper,4139,1,4139] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 9.14/9.38 4232 [hyper,4139,1,42] {+} is_a_theorem(implies(A,implies(B,A))).
% 9.14/9.38 4276 [hyper,4210,1,198] {-} is_a_theorem(implies(implies(implies(A,A),not(B)),implies(B,C))).
% 9.14/9.38 4315 [hyper,4232,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 9.14/9.38 4986 [hyper,4315,1,4276] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 9.14/9.38 5073 [hyper,4986,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 9.14/9.38 5074 [binary,5073.1,2.1] {-} $F.
% 9.14/9.38
% 9.14/9.38 % SZS output end Refutation
% 9.14/9.38 ------------ end of proof -------------
% 9.14/9.38
% 9.14/9.38
% 9.14/9.38 Search stopped by max_proofs option.
% 9.14/9.38
% 9.14/9.38
% 9.14/9.38 Search stopped by max_proofs option.
% 9.14/9.38
% 9.14/9.38 ============ end of search ============
% 9.14/9.38
% 9.14/9.38 ----------- soft-scott stats ----------
% 9.14/9.38
% 9.14/9.38 true clauses given 40 (20.1%)
% 9.14/9.38 false clauses given 159
% 9.14/9.38
% 9.14/9.38 FALSE TRUE
% 9.14/9.38 6 1 1
% 9.14/9.38 8 2 0
% 9.14/9.38 9 0 5
% 9.14/9.38 10 4 0
% 9.14/9.38 11 10 2
% 9.14/9.38 12 12 3
% 9.14/9.38 13 34 8
% 9.14/9.38 14 88 30
% 9.14/9.38 15 170 40
% 9.14/9.38 16 216 58
% 9.14/9.38 17 295 56
% 9.14/9.38 18 338 71
% 9.14/9.38 19 357 71
% 9.14/9.38 20 414 69
% 9.14/9.38 21 424 68
% 9.14/9.38 22 21 0
% 9.14/9.38 23 8 0
% 9.14/9.38 24 16 0
% 9.14/9.38 25 16 0
% 9.14/9.38 26 8 0
% 9.14/9.38 27 7 0
% 9.14/9.38 28 3 0
% 9.14/9.38 29 8 0
% 9.14/9.38 30 1 0
% 9.14/9.38 31 4 0
% 9.14/9.38 32 5 0
% 9.14/9.38 33 1 0
% 9.14/9.38 34 1 0
% 9.14/9.38 35 3 0
% 9.14/9.38 37 1 0
% 9.14/9.38 39 2 0
% 9.14/9.38 40 1 0
% 9.14/9.38 42 1 0
% 9.14/9.38 49 1 0
% 9.14/9.38 tot: 2473 482 (16.3% true)
% 9.14/9.38
% 9.14/9.38
% 9.14/9.38 Model 6 [ 1 1 1683 ] (0.00 seconds, 250000 Inserts)
% 9.14/9.38
% 9.14/9.38 That finishes the proof of the theorem.
% 9.14/9.38
% 9.14/9.38 Process 2124 finished Sun Jul 3 13:20:09 2022
%------------------------------------------------------------------------------