TSTP Solution File: LCL059-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL059-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:38 EDT 2022
% Result : Unsatisfiable 10.39s 10.61s
% Output : Refutation 10.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL059-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 3 04:49:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox2 on n004.cluster.edu,
% 0.14/0.36 Sun Jul 3 04:49:23 2022
% 0.14/0.36 The command was "./sos". The process ID is 27239.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.36
% 0.14/0.36 This is a Horn set without equality. The strategy will
% 0.14/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.36 in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: clear(order_hyper).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36
% 0.14/0.36 ======= 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: 5
% 0.20/0.39 percentage of clauses intially in UL: 40
% 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: 2
% 0.20/0.39 distinct constant count: 2
% 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 =========== start of search ===========
% 9.98/10.20
% 9.98/10.20
% 9.98/10.20 Changing weight limit from 60 to 52.
% 9.98/10.20
% 9.98/10.20 Model 2 (0.00 seconds, 0 Inserts)
% 9.98/10.20
% 9.98/10.20 Stopped by limit on number of solutions
% 9.98/10.20
% 9.98/10.20 Model 3 (0.00 seconds, 0 Inserts)
% 9.98/10.20
% 9.98/10.20 Stopped by limit on number of solutions
% 9.98/10.20
% 9.98/10.20 Model 4 (0.00 seconds, 0 Inserts)
% 9.98/10.20
% 9.98/10.20 Stopped by limit on number of solutions
% 9.98/10.20
% 9.98/10.20 Stopped by limit on insertions
% 9.98/10.20
% 9.98/10.20 Model 5 [ 1 1 71 ] (0.00 seconds, 250000 Inserts)
% 9.98/10.20
% 9.98/10.20 Stopped by limit on insertions
% 9.98/10.20
% 9.98/10.20 Model 6 [ 1 1 51 ] (0.00 seconds, 250000 Inserts)
% 9.98/10.20
% 9.98/10.20 Resetting weight limit to 52 after 145 givens.
% 9.98/10.20
% 10.39/10.61
% 10.39/10.61 -- HEY sandbox2, WE HAVE A PROOF!! --
% 10.39/10.61
% 10.39/10.61 ----> UNIT CONFLICT at 10.19 sec ----> 4522 [binary,4521.1,2.1] {-} $F.
% 10.39/10.61
% 10.39/10.61 Length of proof is 17. Level of proof is 12.
% 10.39/10.61
% 10.39/10.61 ---------------- PROOF ----------------
% 10.39/10.61 % SZS status Unsatisfiable
% 10.39/10.61 % SZS output start Refutation
% 10.39/10.61
% 10.39/10.61 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 10.39/10.61 2 [] {+} -is_a_theorem(implies(implies(not(a),not(b)),implies(b,a))).
% 10.39/10.61 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 10.39/10.61 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 10.39/10.61 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 10.39/10.61 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 10.39/10.61 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 10.39/10.61 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 10.39/10.61 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 10.39/10.61 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 10.39/10.61 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 10.39/10.61 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 10.39/10.61 43 [hyper,29,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 10.39/10.61 57 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 10.39/10.61 73 [hyper,57,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 10.39/10.61 85 [hyper,73,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 10.39/10.61 138 [hyper,12,1,85] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 10.39/10.61 249 [hyper,138,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 10.39/10.61 281 [hyper,249,1,6] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 10.39/10.61 4376 [hyper,281,1,43] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 10.39/10.61 4448 [hyper,4376,1,281] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 10.39/10.61 4521 [hyper,4448,1,4448] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 10.39/10.61 4522 [binary,4521.1,2.1] {-} $F.
% 10.39/10.61
% 10.39/10.61 % SZS output end Refutation
% 10.39/10.61 ------------ end of proof -------------
% 10.39/10.61
% 10.39/10.61
% 10.39/10.61 Search stopped by max_proofs option.
% 10.39/10.61
% 10.39/10.61
% 10.39/10.61 Search stopped by max_proofs option.
% 10.39/10.61
% 10.39/10.61 ============ end of search ============
% 10.39/10.61
% 10.39/10.61 ----------- soft-scott stats ----------
% 10.39/10.61
% 10.39/10.61 true clauses given 39 (22.9%)
% 10.39/10.61 false clauses given 131
% 10.39/10.61
% 10.39/10.61 FALSE TRUE
% 10.39/10.61 8 0 1
% 10.39/10.61 10 0 1
% 10.39/10.61 11 0 1
% 10.39/10.61 12 0 3
% 10.39/10.61 13 6 7
% 10.39/10.61 14 55 25
% 10.39/10.61 15 131 18
% 10.39/10.61 16 184 45
% 10.39/10.61 17 296 16
% 10.39/10.61 18 327 23
% 10.39/10.61 19 354 18
% 10.39/10.61 20 409 39
% 10.39/10.61 21 437 24
% 10.39/10.61 22 301 9
% 10.39/10.61 23 0 11
% 10.39/10.61 24 0 19
% 10.39/10.61 25 0 9
% 10.39/10.61 26 0 7
% 10.39/10.61 27 0 5
% 10.39/10.61 28 0 4
% 10.39/10.61 29 0 9
% 10.39/10.61 30 0 3
% 10.39/10.61 31 0 6
% 10.39/10.61 32 0 2
% 10.39/10.61 33 0 1
% 10.39/10.61 35 0 2
% 10.39/10.61 37 0 1
% 10.39/10.61 39 0 1
% 10.39/10.61 40 0 1
% 10.39/10.61 49 0 1
% 10.39/10.61 52 0 1
% 10.39/10.61 tot: 2500 313 (11.1% true)
% 10.39/10.61
% 10.39/10.61
% 10.39/10.61 Model 6 [ 1 1 51 ] (0.00 seconds, 250000 Inserts)
% 10.39/10.61
% 10.39/10.61 That finishes the proof of the theorem.
% 10.39/10.61
% 10.39/10.61 Process 27239 finished Sun Jul 3 04:49:33 2022
%------------------------------------------------------------------------------