TSTP Solution File: LCL396-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL396-1 : TPTP v8.1.0. Released v2.3.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:29:54 EDT 2022
% Result : Unsatisfiable 24.79s 24.98s
% Output : Refutation 24.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL396-1 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 18:54:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n015.cluster.edu,
% 0.12/0.35 Sat Jul 2 18:54:44 2022
% 0.12/0.35 The command was "./sos". The process ID is 23088.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= 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: 5
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 2
% 0.12/0.38 distinct constant count: 2
% 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 ===========
% 10.42/10.64
% 10.42/10.64
% 10.42/10.64 Changing weight limit from 60 to 49.
% 10.42/10.64
% 10.42/10.64 Model 2 (0.00 seconds, 0 Inserts)
% 10.42/10.64
% 10.42/10.64 Stopped by limit on number of solutions
% 10.42/10.64
% 10.42/10.64 Stopped by limit on insertions
% 10.42/10.64
% 10.42/10.64 Model 3 (0.00 seconds, 0 Inserts)
% 10.42/10.64
% 10.42/10.64 Stopped by limit on number of solutions
% 10.42/10.64
% 10.42/10.64 Stopped by limit on insertions
% 10.42/10.64
% 10.42/10.64 Model 4 [ 1 0 164 ] (0.00 seconds, 250000 Inserts)
% 10.42/10.64
% 10.42/10.64 Stopped by limit on insertions
% 10.42/10.64
% 10.42/10.64 Model 5 [ 1 0 93 ] (0.00 seconds, 250000 Inserts)
% 10.42/10.64
% 10.42/10.64 Resetting weight limit to 49 after 150 givens.
% 10.42/10.64
% 24.79/24.98
% 24.79/24.98 -- HEY sandbox2, WE HAVE A PROOF!! --
% 24.79/24.98
% 24.79/24.98 Stopped by limit on insertions
% 24.79/24.98
% 24.79/24.98 Model 6 [ 1 1 290 ] (0.00 seconds, 250000 Inserts)
% 24.79/24.98
% 24.79/24.98 Stopped by limit on insertions
% 24.79/24.98
% 24.79/24.98 Model 7 [ 1 0 50 ] (0.00 seconds, 250000 Inserts)
% 24.79/24.98
% 24.79/24.98 Stopped by limit on insertions
% 24.79/24.98
% 24.79/24.98 ----> UNIT CONFLICT at 24.59 sec ----> 4970 [binary,4969.1,2.1] {+} $F.
% 24.79/24.98
% 24.79/24.98 Length of proof is 34. Level of proof is 24.
% 24.79/24.98
% 24.79/24.98 ---------------- PROOF ----------------
% 24.79/24.98 % SZS status Unsatisfiable
% 24.79/24.98 % SZS output start Refutation
% 24.79/24.98
% 24.79/24.98 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 24.79/24.98 2 [] {+} -is_a_theorem(implies(implies(not(not(x)),y),implies(x,y))).
% 24.79/24.98 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 24.79/24.98 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 24.79/24.98 5 [] {-} is_a_theorem(implies(A,implies(not(A),B))).
% 24.79/24.98 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 24.79/24.98 7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 24.79/24.98 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 24.79/24.98 16 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 24.79/24.98 21 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 24.79/24.98 25 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 24.79/24.98 57 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 24.79/24.98 70 [hyper,57,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 24.79/24.98 89 [hyper,70,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 24.79/24.98 102 [hyper,89,1,25] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 24.79/24.98 133 [hyper,102,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 24.79/24.98 193 [hyper,133,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 24.79/24.98 206 [hyper,193,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 24.79/24.98 211 [hyper,193,1,7] {-} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 24.79/24.98 278 [hyper,206,1,21] {-} is_a_theorem(implies(implies(implies(A,A),not(B)),implies(B,implies(C,D)))).
% 24.79/24.98 303 [hyper,211,1,16] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 24.79/24.98 361 [hyper,303,1,303] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 24.79/24.98 365 [hyper,303,1,70] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 24.79/24.98 388 [hyper,365,1,303] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 24.79/24.98 441 [hyper,388,1,388] {+} is_a_theorem(implies(A,implies(B,A))).
% 24.79/24.98 517 [hyper,441,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 24.79/24.98 1652 [hyper,517,1,303] {-} is_a_theorem(implies(A,implies(implies(implies(B,not(C)),C),C))).
% 24.79/24.98 1673 [hyper,517,1,278] {-} is_a_theorem(implies(not(A),implies(A,implies(B,C)))).
% 24.79/24.98 1790 [hyper,1673,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(not(A),D))).
% 24.79/24.98 4094 [hyper,1790,1,303] {-} is_a_theorem(implies(not(A),implies(B,implies(A,C)))).
% 24.79/24.98 4128 [hyper,4094,1,303] {-} is_a_theorem(implies(A,implies(not(B),implies(B,C)))).
% 24.79/24.98 4145 [hyper,4128,1,4128] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 24.79/24.98 4220 [hyper,4145,1,303] {-} is_a_theorem(implies(A,implies(not(not(B)),B))).
% 24.79/24.98 4234 [hyper,4220,1,4220] {+} is_a_theorem(implies(not(not(A)),A)).
% 24.79/24.98 4282 [hyper,4234,1,21] {+} is_a_theorem(implies(A,implies(not(not(not(A))),B))).
% 24.79/24.98 4384 [hyper,1652,1,1652] {-} is_a_theorem(implies(implies(implies(A,not(B)),B),B)).
% 24.79/24.98 4554 [hyper,361,1,4384] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 24.79/24.98 4711 [hyper,4282,1,4554] {-} is_a_theorem(implies(A,not(not(A)))).
% 24.79/24.98 4969 [hyper,4711,1,3] {-} is_a_theorem(implies(implies(not(not(A)),B),implies(A,B))).
% 24.79/24.98 4970 [binary,4969.1,2.1] {+} $F.
% 24.79/24.98
% 24.79/24.98 % SZS output end Refutation
% 24.79/24.98 ------------ end of proof -------------
% 24.79/24.98
% 24.79/24.98
% 24.79/24.98 Search stopped by max_proofs option.
% 24.79/24.98
% 24.79/24.98
% 24.79/24.98 Search stopped by max_proofs option.
% 24.79/24.98
% 24.79/24.98 ============ end of search ============
% 24.79/24.98
% 24.79/24.98 ----------- soft-scott stats ----------
% 24.79/24.98
% 24.79/24.98 true clauses given 49 (28.8%)
% 24.79/24.98 false clauses given 121
% 24.79/24.98
% 24.79/24.98 FALSE TRUE
% 24.79/24.98 6 1 0
% 24.79/24.98 8 1 0
% 24.79/24.98 9 0 1
% 24.79/24.98 10 0 6
% 24.79/24.98 11 2 18
% 24.79/24.98 12 1 51
% 24.79/24.98 13 20 60
% 24.79/24.98 14 7 167
% 24.79/24.98 15 41 213
% 24.79/24.98 16 7 348
% 24.79/24.98 17 50 347
% 24.79/24.98 18 4 533
% 24.79/24.98 19 54 440
% 24.79/24.98 20 9 316
% 24.79/24.98 21 50 0
% 24.79/24.98 22 9 0
% 24.79/24.98 23 41 0
% 24.79/24.98 24 9 0
% 24.79/24.98 25 40 0
% 24.79/24.98 26 6 0
% 24.79/24.98 27 50 0
% 24.79/24.98 28 2 0
% 24.79/24.98 29 34 0
% 24.79/24.98 30 3 0
% 24.79/24.98 31 69 0
% 24.79/24.98 32 1 0
% 24.79/24.98 33 7 0
% 24.79/24.98 35 4 0
% 24.79/24.98 37 7 0
% 24.79/24.98 39 6 0
% 24.79/24.98 40 1 0
% 24.79/24.98 41 1 0
% 24.79/24.98 43 2 0
% 24.79/24.98 45 1 0
% 24.79/24.98 49 2 0
% 24.79/24.98 tot: 542 2500 (82.2% true)
% 24.79/24.98
% 24.79/24.98
% 24.79/24.98 Model 7 [ 1 -536 50 ] (0.00 seconds, 250000 Inserts)
% 24.79/24.98
% 24.79/24.98 That finishes the proof of the theorem.
% 24.79/24.98
% 24.79/24.98 Process 23088 finished Sat Jul 2 18:55:09 2022
%------------------------------------------------------------------------------