TSTP Solution File: LCL369-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL369-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:44 EDT 2022
% Result : Unsatisfiable 16.79s 16.99s
% Output : Refutation 16.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL369-1 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 19:13:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox2 on n007.cluster.edu,
% 0.19/0.35 Mon Jul 4 19:13:12 2022
% 0.19/0.35 The command was "./sos". The process ID is 13505.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.19/0.35
% 0.19/0.35 This is a Horn set without equality. The strategy will
% 0.19/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.19/0.35 in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: clear(order_hyper).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 2
% 0.19/0.38 number of clauses initially in problem: 5
% 0.19/0.38 percentage of clauses intially in UL: 40
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 85
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 7
% 0.19/0.38 distinct predicate count: 1
% 0.19/0.38 distinct function count: 2
% 0.19/0.38 distinct constant count: 4
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 6.61/6.79
% 6.61/6.79
% 6.61/6.79 Changing weight limit from 60 to 45.
% 6.61/6.79
% 6.61/6.79 Model 2 (0.00 seconds, 0 Inserts)
% 6.61/6.79
% 6.61/6.79 Stopped by limit on number of solutions
% 6.61/6.79
% 6.61/6.79 Model 3 (0.00 seconds, 0 Inserts)
% 6.61/6.79
% 6.61/6.79 Stopped by limit on number of solutions
% 6.61/6.79
% 6.61/6.79 Stopped by limit on insertions
% 6.61/6.79
% 6.61/6.79 Model 4 [ 1 1 71 ] (0.00 seconds, 250000 Inserts)
% 6.61/6.79
% 6.61/6.79 Model 5 (0.00 seconds, 250000 Inserts)
% 6.61/6.79
% 6.61/6.79 Stopped by limit on number of solutions
% 6.61/6.79
% 6.61/6.79 Stopped by limit on insertions
% 6.61/6.79
% 6.61/6.79 Model 6 [ 1 1 4631 ] (0.00 seconds, 250000 Inserts)
% 6.61/6.79
% 6.61/6.79 Stopped by limit on insertions
% 6.61/6.79
% 6.61/6.79 Model 7 [ 2 8 36871 ] (0.00 seconds, 250000 Inserts)
% 6.61/6.79
% 6.61/6.79 Stopped by limit on insertions
% 6.61/6.79
% 6.61/6.79 Model 8 [ 3 1 6321 ] (0.00 seconds, 250000 Inserts)
% 6.61/6.79
% 6.61/6.79 Resetting weight limit to 45 after 160 givens.
% 6.61/6.79
% 6.61/6.81
% 6.61/6.81
% 6.61/6.81 Changing weight limit from 45 to 43.
% 6.61/6.81
% 6.61/6.81 Resetting weight limit to 43 after 165 givens.
% 6.61/6.81
% 11.18/11.38
% 11.18/11.38
% 11.18/11.38 Changing weight limit from 43 to 26.
% 11.18/11.38
% 11.18/11.38 Stopped by limit on insertions
% 11.18/11.38
% 11.18/11.38 Stopped by limit on insertions
% 11.18/11.38
% 11.18/11.38 Model 9 [ 3 1 2839 ] (0.00 seconds, 250000 Inserts)
% 11.18/11.38
% 11.18/11.38 Resetting weight limit to 26 after 255 givens.
% 11.18/11.38
% 11.21/11.40
% 11.21/11.40
% 11.21/11.40 Changing weight limit from 26 to 25.
% 11.21/11.40
% 11.21/11.40 Resetting weight limit to 25 after 260 givens.
% 11.21/11.40
% 11.26/11.47
% 11.26/11.47
% 11.26/11.47 Changing weight limit from 25 to 23.
% 11.26/11.47
% 11.26/11.47 Resetting weight limit to 23 after 270 givens.
% 11.26/11.47
% 11.41/11.67
% 11.41/11.67
% 11.41/11.67 Changing weight limit from 23 to 21.
% 11.41/11.67
% 11.41/11.67 Resetting weight limit to 21 after 285 givens.
% 11.41/11.67
% 14.56/14.75
% 14.56/14.75
% 14.56/14.75 Changing weight limit from 21 to 20.
% 14.56/14.75
% 14.56/14.75 Stopped by limit on insertions
% 14.56/14.75
% 14.56/14.75 Model 10 [ 5 1 4047 ] (0.00 seconds, 250000 Inserts)
% 14.56/14.75
% 14.56/14.75 Stopped by limit on insertions
% 14.56/14.75
% 14.56/14.75 Model 11 [ 4 24 87064 ] (0.00 seconds, 250000 Inserts)
% 14.56/14.75
% 14.56/14.75 Resetting weight limit to 20 after 340 givens.
% 14.56/14.75
% 14.70/14.93
% 14.70/14.93
% 14.70/14.93 Changing weight limit from 20 to 18.
% 14.70/14.93
% 14.70/14.93 Resetting weight limit to 18 after 350 givens.
% 14.70/14.93
% 14.86/15.10
% 14.86/15.10
% 14.86/15.10 Changing weight limit from 18 to 17.
% 14.86/15.10
% 14.86/15.10 Modelling stopped after 300 given clauses and 0.00 seconds
% 14.86/15.10
% 14.86/15.10
% 14.86/15.10 Resetting weight limit to 17 after 395 givens.
% 14.86/15.10
% 15.40/15.59
% 15.40/15.59
% 15.40/15.59 Changing weight limit from 17 to 16.
% 15.40/15.59
% 15.40/15.59 Resetting weight limit to 16 after 485 givens.
% 15.40/15.59
% 16.79/16.98
% 16.79/16.99 -- HEY sandbox2, WE HAVE A PROOF!! --
% 16.79/16.99
% 16.79/16.99 ----> UNIT CONFLICT at 16.43 sec ----> 31885 [binary,31884.1,2.1] {-} $F.
% 16.79/16.99
% 16.79/16.99 Length of proof is 33. Level of proof is 21.
% 16.79/16.99
% 16.79/16.99 ---------------- PROOF ----------------
% 16.79/16.99 % SZS status Unsatisfiable
% 16.79/16.99 % SZS output start Refutation
% 16.79/16.99
% 16.79/16.99 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 16.79/16.99 2 [] {+} -is_a_theorem(implies(implies(implies(x,y),z),implies(implies(x,u),implies(implies(u,y),z)))).
% 16.79/16.99 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 16.79/16.99 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 16.79/16.99 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 16.79/16.99 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 16.79/16.99 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 16.79/16.99 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 16.79/16.99 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 16.79/16.99 17 [hyper,7,1,3] {-} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).
% 16.79/16.99 21 [hyper,6,1,7] {-} is_a_theorem(implies(implies(not(implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(C,A),D))).
% 16.79/16.99 22 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 16.79/16.99 27 [hyper,6,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(implies(A,C),D),implies(implies(B,C),D)))).
% 16.79/16.99 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 16.79/16.99 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 16.79/16.99 36 [hyper,34,1,5] {+} is_a_theorem(implies(not(implies(A,A)),B)).
% 16.79/16.99 64 [hyper,29,1,9] {-} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 16.79/16.99 67 [hyper,29,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 16.79/16.99 69 [hyper,29,1,36] {-} is_a_theorem(implies(A,implies(not(implies(B,B)),C))).
% 16.79/16.99 78 [hyper,64,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 16.79/16.99 95 [hyper,69,1,3] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 16.79/16.99 326 [hyper,95,1,12] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 16.79/16.99 493 [hyper,326,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 16.79/16.99 503 [hyper,493,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 16.79/16.99 1676 [hyper,503,1,78] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 16.79/16.99 1708 [hyper,1676,1,503] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 16.79/16.99 1886 [hyper,1708,1,17] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 16.79/16.99 3820 [hyper,67,1,503] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 16.79/16.99 3855 [hyper,3820,1,1886] {-} is_a_theorem(implies(not(A),implies(B,implies(A,C)))).
% 16.79/16.99 3888 [hyper,3855,1,503] {-} is_a_theorem(implies(A,implies(not(B),implies(B,C)))).
% 16.79/16.99 3929 [hyper,3888,1,17] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 16.79/16.99 16077 [hyper,3929,1,503] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 16.79/16.99 16168 [hyper,16077,1,21] {-} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 16.79/16.99 16338 [hyper,16168,1,503] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 16.79/16.99 17245 [hyper,16338,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 16.79/16.99 17658 [hyper,17245,1,1886] {-} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 16.79/16.99 17900 [hyper,17658,1,22] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 16.79/16.99 31884 [hyper,17900,1,27] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(A,D),implies(implies(D,B),C)))).
% 16.79/16.99 31885 [binary,31884.1,2.1] {-} $F.
% 16.79/16.99
% 16.79/16.99 % SZS output end Refutation
% 16.79/16.99 ------------ end of proof -------------
% 16.79/16.99
% 16.79/16.99
% 16.79/16.99 Search stopped by max_proofs option.
% 16.79/16.99
% 16.79/16.99
% 16.79/16.99 Search stopped by max_proofs option.
% 16.79/16.99
% 16.79/16.99 ============ end of search ============
% 16.79/16.99
% 16.79/16.99 ----------- soft-scott stats ----------
% 16.79/16.99
% 16.79/16.99 true clauses given 261 (26.4%)
% 16.79/16.99 false clauses given 726
% 16.79/16.99
% 16.79/16.99 FALSE TRUE
% 16.79/16.99 12 186 204
% 16.79/16.99 13 958 392
% 16.79/16.99 14 1352 721
% 16.79/16.99 15 4 1070
% 16.79/16.99 16 8 112
% 16.79/16.99 tot: 2508 2499 (49.9% true)
% 16.79/16.99
% 16.79/16.99
% 16.79/16.99 Model 11 [ 4 24 87064 ] (0.00 seconds, 250000 Inserts)
% 16.79/16.99
% 16.79/16.99 That finishes the proof of the theorem.
% 16.79/16.99
% 16.79/16.99 Process 13505 finished Mon Jul 4 19:13:29 2022
%------------------------------------------------------------------------------