TSTP Solution File: LCL028-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL028-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:27 EDT 2022
% Result : Unsatisfiable 12.43s 12.59s
% Output : Refutation 12.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL028-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/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 21:07:14 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 sandbox on n015.cluster.edu,
% 0.12/0.35 Sat Jul 2 21:07:14 2022
% 0.12/0.35 The command was "./sos". The process ID is 26446.
% 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.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: 7
% 0.20/0.38 distinct predicate count: 1
% 0.20/0.38 distinct function count: 1
% 0.20/0.38 distinct constant count: 5
% 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 Model 2 (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 =========== start of search ===========
% 5.43/5.65
% 5.43/5.65
% 5.43/5.65 Changing weight limit from 60 to 50.
% 5.43/5.65
% 5.43/5.65 Model 3 (0.00 seconds, 0 Inserts)
% 5.43/5.65
% 5.43/5.65 Stopped by limit on number of solutions
% 5.43/5.65
% 5.43/5.65 Model 4 (0.00 seconds, 0 Inserts)
% 5.43/5.65
% 5.43/5.65 Stopped by limit on number of solutions
% 5.43/5.65
% 5.43/5.65 Stopped by limit on insertions
% 5.43/5.65
% 5.43/5.65 Model 5 [ 1 7 7312 ] (0.00 seconds, 250000 Inserts)
% 5.43/5.65
% 5.43/5.65 Model 6 (0.00 seconds, 250000 Inserts)
% 5.43/5.65
% 5.43/5.65 Stopped by limit on number of solutions
% 5.43/5.65
% 5.43/5.65 Resetting weight limit to 50 after 230 givens.
% 5.43/5.65
% 6.74/6.93
% 6.74/6.93
% 6.74/6.93 Changing weight limit from 50 to 34.
% 6.74/6.93
% 6.74/6.93 Resetting weight limit to 34 after 395 givens.
% 6.74/6.93
% 6.74/6.96
% 6.74/6.96
% 6.74/6.96 Changing weight limit from 34 to 30.
% 6.74/6.96
% 6.74/6.96 Resetting weight limit to 30 after 400 givens.
% 6.74/6.96
% 6.84/7.03
% 6.84/7.03
% 6.84/7.03 Changing weight limit from 30 to 28.
% 6.84/7.03
% 6.84/7.03 Modelling stopped after 300 given clauses and 0.00 seconds
% 6.84/7.03
% 6.84/7.03
% 6.84/7.03 Resetting weight limit to 28 after 410 givens.
% 6.84/7.03
% 6.84/7.06
% 6.84/7.06
% 6.84/7.06 Changing weight limit from 28 to 26.
% 6.84/7.06
% 6.84/7.06 Resetting weight limit to 26 after 415 givens.
% 6.84/7.06
% 6.96/7.12
% 6.96/7.12
% 6.96/7.12 Changing weight limit from 26 to 24.
% 6.96/7.12
% 6.96/7.12 Resetting weight limit to 24 after 420 givens.
% 6.96/7.12
% 7.04/7.21
% 7.04/7.21
% 7.04/7.21 Changing weight limit from 24 to 22.
% 7.04/7.21
% 7.04/7.21 Resetting weight limit to 22 after 430 givens.
% 7.04/7.21
% 7.34/7.55
% 7.34/7.55
% 7.34/7.55 Changing weight limit from 22 to 20.
% 7.34/7.55
% 7.34/7.55 Resetting weight limit to 20 after 465 givens.
% 7.34/7.55
% 9.33/9.48
% 9.33/9.48
% 9.33/9.48 Changing weight limit from 20 to 18.
% 9.33/9.48
% 9.33/9.48 Resetting weight limit to 18 after 715 givens.
% 9.33/9.48
% 12.43/12.59
% 12.43/12.59 -- HEY sandbox, WE HAVE A PROOF!! --
% 12.43/12.59
% 12.43/12.59 ----> UNIT CONFLICT at 11.98 sec ----> 37768 [binary,37767.1,2.1] {-} $F.
% 12.43/12.59
% 12.43/12.59 Length of proof is 47. Level of proof is 13.
% 12.43/12.59
% 12.43/12.59 ---------------- PROOF ----------------
% 12.43/12.59 % SZS status Unsatisfiable
% 12.43/12.59 % SZS output start Refutation
% 12.43/12.59
% 12.43/12.59 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 12.43/12.59 2 [] {+} -is_a_theorem(implies(implies(implies(implies(implies(a,b),implies(c,falsehood)),e),falsehood),implies(implies(falsehood,a),implies(c,a)))).
% 12.43/12.59 3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 12.43/12.59 4 [] {-} is_a_theorem(implies(implies(implies(A,falsehood),falsehood),A)).
% 12.43/12.59 5 [] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 12.43/12.59 6 [hyper,3,1,3] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 12.43/12.59 8 [hyper,4,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,falsehood),falsehood),B))).
% 12.43/12.59 9 [hyper,8,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(implies(C,falsehood),falsehood),C)))).
% 12.43/12.59 12 [hyper,5,1,5] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))).
% 12.43/12.59 13 [hyper,5,1,3] {-} is_a_theorem(implies(A,implies(implies(B,implies(C,D)),implies(implies(B,C),implies(B,D))))).
% 12.43/12.59 14 [hyper,5,1,8] {-} is_a_theorem(implies(implies(A,implies(implies(B,falsehood),falsehood)),implies(A,B))).
% 12.43/12.59 16 [hyper,5,1,3] {+} is_a_theorem(implies(implies(A,B),implies(A,A))).
% 12.43/12.59 19 [hyper,16,1,9] {+} is_a_theorem(implies(A,A)).
% 12.43/12.59 22 [hyper,14,1,3] {-} is_a_theorem(implies(A,implies(implies(B,implies(implies(C,falsehood),falsehood)),implies(B,C)))).
% 12.43/12.59 24 [hyper,14,1,3] {+} is_a_theorem(implies(falsehood,A)).
% 12.43/12.59 26 [hyper,24,1,3] {+} is_a_theorem(implies(A,implies(falsehood,B))).
% 12.43/12.59 30 [hyper,6,1,5] {-} is_a_theorem(implies(implies(A,B),implies(A,implies(C,B)))).
% 12.43/12.59 31 [hyper,6,1,3] {+} is_a_theorem(implies(A,implies(B,implies(C,implies(D,C))))).
% 12.43/12.59 35 [hyper,19,1,5] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(implies(A,B),B))).
% 12.43/12.59 39 [hyper,35,1,3] {+} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(implies(B,C),C)))).
% 12.43/12.59 49 [hyper,26,1,5] {-} is_a_theorem(implies(implies(A,falsehood),implies(A,B))).
% 12.43/12.59 66 [hyper,12,1,6] {+} is_a_theorem(implies(implies(A,implies(implies(B,A),C)),implies(A,C))).
% 12.43/12.59 81 [hyper,13,1,12] {+} 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))).
% 12.43/12.59 82 [hyper,13,1,5] {+} is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(A,implies(implies(B,C),implies(B,D))))).
% 12.43/12.59 89 [hyper,49,1,3] {+} is_a_theorem(implies(A,implies(implies(B,falsehood),implies(B,C)))).
% 12.43/12.59 100 [hyper,30,1,5] {+} is_a_theorem(implies(implies(implies(A,B),A),implies(implies(A,B),implies(C,B)))).
% 12.43/12.59 209 [hyper,22,1,5] {-} is_a_theorem(implies(implies(A,implies(B,implies(implies(C,falsehood),falsehood))),implies(A,implies(B,C)))).
% 12.43/12.59 254 [hyper,31,1,12] {+} is_a_theorem(implies(implies(A,implies(implies(B,implies(C,B)),D)),implies(A,D))).
% 12.43/12.59 362 [hyper,89,1,12] {+} is_a_theorem(implies(implies(implies(A,falsehood),implies(implies(A,B),C)),implies(implies(A,falsehood),C))).
% 12.43/12.59 363 [hyper,89,1,5] {+} is_a_theorem(implies(implies(A,implies(B,falsehood)),implies(A,implies(B,C)))).
% 12.43/12.59 1307 [hyper,66,1,39] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 12.43/12.59 1308 [hyper,66,1,13] {+} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 12.43/12.59 1384 [hyper,1307,1,3] {+} is_a_theorem(implies(A,implies(B,implies(implies(B,C),C)))).
% 12.43/12.59 1727 [hyper,1384,1,5] {+} is_a_theorem(implies(implies(A,B),implies(A,implies(implies(B,C),C)))).
% 12.43/12.59 5875 [hyper,363,1,1307] {+} is_a_theorem(implies(A,implies(implies(A,falsehood),B))).
% 12.43/12.59 6141 [hyper,5875,1,30] {+} is_a_theorem(implies(A,implies(B,implies(implies(A,falsehood),C)))).
% 12.43/12.59 6799 [hyper,6141,1,82] {+} is_a_theorem(implies(A,implies(implies(B,implies(A,falsehood)),implies(B,C)))).
% 12.43/12.59 13822 [hyper,1308,1,254] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 12.43/12.59 14262 [hyper,13822,1,209] {-} is_a_theorem(implies(implies(implies(A,B),implies(implies(C,falsehood),falsehood)),implies(B,C))).
% 12.43/12.59 14272 [hyper,13822,1,3] {+} is_a_theorem(implies(A,implies(implies(implies(B,C),D),implies(C,D)))).
% 12.43/12.59 14282 [hyper,13822,1,100] {+} is_a_theorem(implies(A,implies(implies(A,B),implies(C,B)))).
% 12.43/12.59 18251 [hyper,362,1,14262] {-} is_a_theorem(implies(implies(implies(A,B),falsehood),A)).
% 12.43/12.59 18306 [hyper,18251,1,1727] {-} is_a_theorem(implies(implies(implies(A,B),falsehood),implies(implies(A,C),C))).
% 12.43/12.59 18310 [hyper,18251,1,1308] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),falsehood)),implies(A,B))).
% 12.43/12.59 18666 [hyper,18310,1,1308] {-} is_a_theorem(implies(implies(A,implies(B,implies(implies(C,D),falsehood))),implies(A,implies(B,C)))).
% 12.43/12.59 24057 [hyper,14272,1,81] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 12.43/12.59 26697 [hyper,24057,1,18306] {-} is_a_theorem(implies(implies(A,B),implies(implies(implies(A,C),falsehood),B))).
% 12.43/12.59 26717 [hyper,24057,1,6799] {+} is_a_theorem(implies(implies(A,implies(B,falsehood)),implies(B,implies(A,C)))).
% 12.43/12.59 27230 [hyper,26697,1,14282] {-} is_a_theorem(implies(implies(implies(A,B),falsehood),implies(implies(A,C),implies(D,C)))).
% 12.43/12.59 29961 [hyper,27230,1,24057] {-} is_a_theorem(implies(implies(A,B),implies(implies(implies(A,C),falsehood),implies(D,B)))).
% 12.43/12.59 37577 [hyper,18666,1,26717] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,falsehood)),implies(C,A))).
% 12.43/12.59 37767 [hyper,37577,1,29961] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),implies(C,falsehood)),D),falsehood),implies(E,implies(C,A)))).
% 12.43/12.59 37768 [binary,37767.1,2.1] {-} $F.
% 12.43/12.59
% 12.43/12.59 % SZS output end Refutation
% 12.43/12.59 ------------ end of proof -------------
% 12.43/12.59
% 12.43/12.59
% 12.43/12.59 Search stopped by max_proofs option.
% 12.43/12.59
% 12.43/12.59
% 12.43/12.59 Search stopped by max_proofs option.
% 12.43/12.59
% 12.43/12.59 ============ end of search ============
% 12.43/12.59
% 12.43/12.59 ----------- soft-scott stats ----------
% 12.43/12.59
% 12.43/12.59 true clauses given 408 (30.7%)
% 12.43/12.59 false clauses given 919
% 12.43/12.59
% 12.43/12.59 FALSE TRUE
% 12.43/12.59 12 2 0
% 12.43/12.59 14 3 544
% 12.43/12.59 16 1343 1937
% 12.43/12.59 18 1191 87
% 12.43/12.59 tot: 2539 2568 (50.3% true)
% 12.43/12.59
% 12.43/12.59
% 12.43/12.59 Model 6 (0.00 seconds, 250000 Inserts)
% 12.43/12.59
% 12.43/12.59 That finishes the proof of the theorem.
% 12.43/12.59
% 12.43/12.59 Process 26446 finished Sat Jul 2 21:07:26 2022
%------------------------------------------------------------------------------