TSTP Solution File: LCL071-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL071-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:43 EDT 2022
% Result : Unsatisfiable 12.50s 12.68s
% Output : Refutation 12.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL071-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n019.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 15:29:23 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 n019.cluster.edu,
% 0.12/0.35 Sat Jul 2 15:29:23 2022
% 0.12/0.35 The command was "./sos". The process ID is 21379.
% 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.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 2
% 0.12/0.37 number of clauses initially in problem: 5
% 0.12/0.37 percentage of clauses intially in UL: 40
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 4
% 0.12/0.37 distinct predicate count: 1
% 0.12/0.37 distinct function count: 2
% 0.12/0.37 distinct constant count: 1
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 3.72/3.96
% 3.72/3.96
% 3.72/3.96 Changing weight limit from 60 to 57.
% 3.72/3.96
% 3.72/3.96 Model 2 (0.00 seconds, 0 Inserts)
% 3.72/3.96
% 3.72/3.96 Stopped by limit on number of solutions
% 3.72/3.96
% 3.72/3.96 Model 3 (0.00 seconds, 0 Inserts)
% 3.72/3.96
% 3.72/3.96 Stopped by limit on number of solutions
% 3.72/3.96
% 3.72/3.96 Resetting weight limit to 57 after 270 givens.
% 3.72/3.96
% 5.74/5.96
% 5.74/5.96
% 5.74/5.96 Changing weight limit from 57 to 58.
% 5.74/5.96
% 5.74/5.96 Model 4 (0.00 seconds, 0 Inserts)
% 5.74/5.96
% 5.74/5.96 Stopped by limit on number of solutions
% 5.74/5.96
% 5.74/5.96 Resetting weight limit to 58 after 280 givens.
% 5.74/5.96
% 5.74/5.99
% 5.74/5.99
% 5.74/5.99 Changing weight limit from 58 to 59.
% 5.74/5.99
% 5.74/5.99 Resetting weight limit to 59 after 285 givens.
% 5.74/5.99
% 7.90/8.10
% 7.90/8.10
% 7.90/8.10 Changing weight limit from 59 to 57.
% 7.90/8.10
% 7.90/8.10 Model 5 [ 1 1 647 ] (0.00 seconds, 67422 Inserts)
% 7.90/8.10
% 7.90/8.10 Resetting weight limit to 57 after 290 givens.
% 7.90/8.10
% 10.02/10.24
% 10.02/10.24
% 10.02/10.24 Changing weight limit from 57 to 58.
% 10.02/10.24
% 10.02/10.24 Model 6 [ 1 0 263 ] (0.00 seconds, 30746 Inserts)
% 10.02/10.24
% 10.02/10.24 Resetting weight limit to 58 after 325 givens.
% 10.02/10.24
% 10.02/10.24
% 10.02/10.24
% 10.02/10.24 Changing weight limit from 58 to 59.
% 10.02/10.24
% 10.02/10.24 Resetting weight limit to 59 after 330 givens.
% 10.02/10.24
% 10.12/10.30
% 10.12/10.30
% 10.12/10.30 Changing weight limit from 59 to 57.
% 10.12/10.30
% 10.12/10.30 Resetting weight limit to 57 after 335 givens.
% 10.12/10.30
% 10.71/10.94
% 10.71/10.94
% 10.71/10.94 Changing weight limit from 57 to 42.
% 10.71/10.94
% 10.71/10.94 Modelling stopped after 300 given clauses and 0.00 seconds
% 10.71/10.94
% 10.71/10.94
% 10.71/10.94 Resetting weight limit to 42 after 425 givens.
% 10.71/10.94
% 10.81/10.99
% 10.81/10.99
% 10.81/10.99 Changing weight limit from 42 to 36.
% 10.81/10.99
% 10.81/10.99 Resetting weight limit to 36 after 430 givens.
% 10.81/10.99
% 11.01/11.20
% 11.01/11.20
% 11.01/11.20 Changing weight limit from 36 to 30.
% 11.01/11.20
% 11.01/11.20 Resetting weight limit to 30 after 435 givens.
% 11.01/11.20
% 11.01/11.24
% 11.01/11.24
% 11.01/11.24 Changing weight limit from 30 to 29.
% 11.01/11.24
% 11.01/11.24 Resetting weight limit to 29 after 440 givens.
% 11.01/11.24
% 11.01/11.25
% 11.01/11.25
% 11.01/11.25 Changing weight limit from 29 to 28.
% 11.01/11.25
% 11.01/11.25 Resetting weight limit to 28 after 445 givens.
% 11.01/11.25
% 11.14/11.32
% 11.14/11.32
% 11.14/11.32 Changing weight limit from 28 to 27.
% 11.14/11.32
% 11.14/11.32 Resetting weight limit to 27 after 455 givens.
% 11.14/11.32
% 11.16/11.34
% 11.16/11.34
% 11.16/11.34 Changing weight limit from 27 to 26.
% 11.16/11.34
% 11.16/11.34 Resetting weight limit to 26 after 460 givens.
% 11.16/11.34
% 11.30/11.49
% 11.30/11.49
% 11.30/11.49 Changing weight limit from 26 to 24.
% 11.30/11.49
% 11.30/11.49 Resetting weight limit to 24 after 470 givens.
% 11.30/11.49
% 11.39/11.58
% 11.39/11.58
% 11.39/11.58 Changing weight limit from 24 to 23.
% 11.39/11.58
% 11.39/11.58 Resetting weight limit to 23 after 485 givens.
% 11.39/11.58
% 11.45/11.66
% 11.45/11.66
% 11.45/11.66 Changing weight limit from 23 to 22.
% 11.45/11.66
% 11.45/11.66 Resetting weight limit to 22 after 500 givens.
% 11.45/11.66
% 11.70/11.89
% 11.70/11.89
% 11.70/11.89 Changing weight limit from 22 to 21.
% 11.70/11.89
% 11.70/11.89 Resetting weight limit to 21 after 525 givens.
% 11.70/11.89
% 11.75/11.99
% 11.75/11.99
% 11.75/11.99 Changing weight limit from 21 to 20.
% 11.75/11.99
% 11.75/11.99 Resetting weight limit to 20 after 555 givens.
% 11.75/11.99
% 11.99/12.20
% 11.99/12.20
% 11.99/12.20 Changing weight limit from 20 to 19.
% 11.99/12.20
% 11.99/12.20 Resetting weight limit to 19 after 590 givens.
% 11.99/12.20
% 12.06/12.32
% 12.06/12.32
% 12.06/12.32 Changing weight limit from 19 to 18.
% 12.06/12.32
% 12.06/12.32 Resetting weight limit to 18 after 605 givens.
% 12.06/12.32
% 12.50/12.68
% 12.50/12.68 -- HEY sandbox, WE HAVE A PROOF!! --
% 12.50/12.68
% 12.50/12.68 ----> UNIT CONFLICT at 12.23 sec ----> 17364 [binary,17363.1,2.1] {-} $F.
% 12.50/12.68
% 12.50/12.68 Length of proof is 55. Level of proof is 27.
% 12.50/12.68
% 12.50/12.68 ---------------- PROOF ----------------
% 12.50/12.68 % SZS status Unsatisfiable
% 12.50/12.68 % SZS output start Refutation
% 12.50/12.68
% 12.50/12.68 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 12.50/12.68 2 [] {+} -is_a_theorem(implies(implies(not(a),a),a)).
% 12.50/12.68 3 [] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 12.50/12.68 4 [] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 12.50/12.68 5 [] {-} is_a_theorem(implies(implies(A,implies(not(B),C)),implies(A,implies(implies(D,C),implies(implies(B,D),C))))).
% 12.50/12.68 6 [hyper,3,1,3] {+} is_a_theorem(implies(A,implies(B,A))).
% 12.50/12.68 7 [hyper,6,1,6] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 12.50/12.68 8 [hyper,6,1,3] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 12.50/12.68 11 [hyper,4,1,4] {-} is_a_theorem(implies(not(implies(A,B)),implies(not(A),C))).
% 12.50/12.68 12 [hyper,4,1,6] {-} is_a_theorem(implies(not(A),implies(B,implies(A,C)))).
% 12.50/12.68 13 [hyper,4,1,3] {-} is_a_theorem(implies(not(implies(A,B)),implies(B,C))).
% 12.50/12.68 17 [hyper,5,1,5] {-} is_a_theorem(implies(implies(not(A),implies(not(B),C)),implies(implies(D,implies(implies(E,C),implies(implies(B,E),C))),implies(implies(A,D),implies(implies(E,C),implies(implies(B,E),C)))))).
% 12.50/12.68 19 [hyper,5,1,3] {-} is_a_theorem(implies(implies(not(A),B),implies(C,implies(implies(D,B),implies(implies(A,D),B))))).
% 12.50/12.68 21 [hyper,5,1,7] {-} is_a_theorem(implies(A,implies(implies(B,implies(C,not(D))),implies(implies(D,B),implies(C,not(D)))))).
% 12.50/12.68 22 [hyper,5,1,4] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(D,C),implies(implies(A,D),C)))).
% 12.50/12.68 23 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(A,not(B)),C),implies(implies(D,C),implies(implies(B,D),C)))).
% 12.50/12.68 31 [hyper,8,1,4] {-} is_a_theorem(implies(not(A),implies(B,implies(C,implies(A,D))))).
% 12.50/12.68 96 [hyper,17,1,11] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),implies(implies(D,B),C))),implies(implies(implies(D,E),A),implies(implies(B,C),implies(implies(D,B),C))))).
% 12.50/12.68 122 [hyper,21,1,21] {-} is_a_theorem(implies(implies(A,implies(B,not(C))),implies(implies(C,A),implies(B,not(C))))).
% 12.50/12.68 130 [hyper,122,1,13] {-} is_a_theorem(implies(implies(A,not(implies(B,C))),implies(C,not(A)))).
% 12.50/12.68 132 [hyper,122,1,6] {-} is_a_theorem(implies(implies(A,not(A)),implies(B,not(A)))).
% 12.50/12.68 134 [hyper,122,1,3] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),not(A))),implies(C,not(A)))).
% 12.50/12.68 135 [hyper,132,1,122] {-} is_a_theorem(implies(implies(A,implies(A,not(A))),implies(B,not(A)))).
% 12.50/12.68 143 [hyper,22,1,122] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),implies(D,not(B)))),implies(implies(C,A),implies(implies(B,C),implies(D,not(B)))))).
% 12.50/12.68 155 [hyper,130,1,122] {-} is_a_theorem(implies(implies(A,implies(A,not(implies(B,C)))),implies(C,not(A)))).
% 12.50/12.68 352 [hyper,155,1,122] {-} is_a_theorem(implies(implies(A,implies(A,implies(A,not(implies(B,C))))),implies(C,not(A)))).
% 12.50/12.68 358 [hyper,155,1,135] {-} is_a_theorem(implies(A,not(implies(implies(B,A),implies(implies(B,A),not(implies(B,A))))))).
% 12.50/12.68 1882 [hyper,358,1,130] {-} is_a_theorem(implies(implies(implies(A,B),not(implies(A,B))),not(B))).
% 12.50/12.68 2076 [hyper,1882,1,23] {-} is_a_theorem(implies(implies(A,not(B)),implies(implies(implies(C,B),A),not(B)))).
% 12.50/12.68 2091 [hyper,2076,1,4] {-} is_a_theorem(implies(not(A),implies(implies(implies(B,C),A),not(C)))).
% 12.50/12.68 2118 [hyper,2091,1,134] {+} is_a_theorem(implies(A,not(not(A)))).
% 12.50/12.68 2795 [hyper,96,1,31] {-} is_a_theorem(implies(implies(implies(A,B),not(C)),implies(implies(D,implies(C,E)),implies(implies(A,D),implies(C,E))))).
% 12.50/12.68 2799 [hyper,96,1,22] {-} is_a_theorem(implies(implies(implies(A,B),implies(implies(A,C),D)),implies(implies(E,D),implies(implies(A,E),D)))).
% 12.50/12.68 2972 [hyper,2799,1,352] {-} is_a_theorem(implies(implies(A,not(B)),implies(implies(B,A),not(B)))).
% 12.50/12.68 3022 [hyper,2795,1,2118] {-} is_a_theorem(implies(implies(A,implies(not(implies(B,C)),D)),implies(implies(B,A),implies(not(implies(B,C)),D)))).
% 12.50/12.68 3072 [hyper,3022,1,6] {-} is_a_theorem(implies(implies(A,B),implies(not(implies(A,C)),B))).
% 12.50/12.68 3077 [hyper,3072,1,3022] {-} is_a_theorem(implies(implies(A,implies(A,B)),implies(not(implies(A,C)),B))).
% 12.50/12.68 3161 [hyper,3072,1,6] {-} is_a_theorem(implies(not(implies(A,B)),implies(C,A))).
% 12.50/12.68 3169 [hyper,3161,1,3022] {-} is_a_theorem(implies(implies(A,not(implies(B,C))),implies(not(implies(A,D)),B))).
% 12.50/12.68 3437 [hyper,3077,1,6] {+} is_a_theorem(implies(not(implies(A,B)),A)).
% 12.50/12.68 3457 [hyper,3437,1,19] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(implies(implies(C,D),B),C)))).
% 12.50/12.68 3496 [hyper,2972,1,4] {-} is_a_theorem(implies(not(A),implies(implies(B,A),not(B)))).
% 12.50/12.68 3499 [hyper,2972,1,2118] {-} is_a_theorem(implies(implies(not(A),A),not(not(A)))).
% 12.50/12.68 3536 [hyper,3499,1,3161] {+} is_a_theorem(not(not(implies(A,A)))).
% 12.50/12.68 3650 [hyper,3536,1,3496] {-} is_a_theorem(implies(implies(A,not(implies(B,B))),not(A))).
% 12.50/12.68 3698 [hyper,3650,1,3650] {-} is_a_theorem(not(implies(implies(A,A),not(implies(B,B))))).
% 12.50/12.68 3724 [hyper,3698,1,3437] {+} is_a_theorem(implies(A,A)).
% 12.50/12.68 3757 [hyper,3724,1,2076] {-} is_a_theorem(implies(implies(implies(A,B),not(B)),not(B))).
% 12.50/12.68 4178 [hyper,3457,1,3457] {-} is_a_theorem(implies(implies(A,B),implies(implies(implies(B,C),A),B))).
% 12.50/12.68 5125 [hyper,143,1,12] {-} is_a_theorem(implies(implies(A,not(B)),implies(implies(C,A),implies(B,not(C))))).
% 12.50/12.68 12545 [hyper,5125,1,2118] {-} is_a_theorem(implies(implies(A,B),implies(not(B),not(A)))).
% 12.50/12.68 12639 [hyper,12545,1,3757] {-} is_a_theorem(implies(not(not(A)),not(implies(implies(B,A),not(A))))).
% 12.50/12.68 12647 [hyper,12545,1,3650] {-} is_a_theorem(implies(not(not(A)),not(implies(A,not(implies(B,B)))))).
% 12.50/12.68 14605 [hyper,12639,1,3169] {-} is_a_theorem(implies(not(implies(not(not(A)),B)),implies(C,A))).
% 12.50/12.68 14628 [hyper,14605,1,3499] {+} is_a_theorem(not(not(implies(not(not(A)),A)))).
% 12.50/12.68 14762 [hyper,14628,1,12647] {-} is_a_theorem(not(implies(implies(not(not(A)),A),not(implies(B,B))))).
% 12.50/12.68 17102 [hyper,14762,1,3437] {-} is_a_theorem(implies(not(not(A)),A)).
% 12.50/12.68 17123 [hyper,17102,1,4178] {-} is_a_theorem(implies(implies(implies(A,B),not(not(A))),A)).
% 12.50/12.68 17208 [hyper,17123,1,23] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(B),A),B))).
% 12.50/12.68 17363 [hyper,17208,1,3724] {-} is_a_theorem(implies(implies(not(A),A),A)).
% 12.50/12.68 17364 [binary,17363.1,2.1] {-} $F.
% 12.50/12.68
% 12.50/12.68 % SZS output end Refutation
% 12.50/12.68 ------------ end of proof -------------
% 12.50/12.68
% 12.50/12.68
% 12.50/12.68 Search stopped by max_proofs option.
% 12.50/12.68
% 12.50/12.68
% 12.50/12.68 Search stopped by max_proofs option.
% 12.50/12.68
% 12.50/12.68 ============ end of search ============
% 12.50/12.68
% 12.50/12.68 ----------- soft-scott stats ----------
% 12.50/12.68
% 12.50/12.68 true clauses given 167 (24.2%)
% 12.50/12.68 false clauses given 523
% 12.50/12.68
% 12.50/12.68 FALSE TRUE
% 12.50/12.68 10 0 12
% 12.50/12.68 11 0 69
% 12.50/12.68 12 9 246
% 12.50/12.68 13 26 277
% 12.50/12.68 14 371 664
% 12.50/12.68 15 288 636
% 12.50/12.68 16 1090 596
% 12.50/12.68 17 671 0
% 12.50/12.68 18 45 0
% 12.50/12.68 tot: 2500 2500 (50.0% true)
% 12.50/12.68
% 12.50/12.68
% 12.50/12.68 Model 6 [ 1 0 263 ] (0.00 seconds, 30746 Inserts)
% 12.50/12.68
% 12.50/12.68 That finishes the proof of the theorem.
% 12.50/12.68
% 12.50/12.68 Process 21379 finished Sat Jul 2 15:29:36 2022
%------------------------------------------------------------------------------