TSTP Solution File: LCL116-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL116-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:28:02 EDT 2022
% Result : Unsatisfiable 4.28s 4.47s
% Output : Refutation 4.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL116-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n024.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 : Sat Jul 2 21:47:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n024.cluster.edu,
% 0.13/0.36 Sat Jul 2 21:47:00 2022
% 0.13/0.36 The command was "./sos". The process ID is 13739.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set without equality. The strategy will
% 0.13/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36 in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 2
% 0.19/0.40 number of clauses initially in problem: 6
% 0.19/0.40 percentage of clauses intially in UL: 33
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 5
% 0.19/0.40 distinct predicate count: 1
% 0.19/0.40 distinct function count: 2
% 0.19/0.40 distinct constant count: 2
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.87/1.07
% 0.87/1.07
% 0.87/1.07 Changing weight limit from 60 to 22.
% 0.87/1.07
% 0.87/1.07 Model 3 (0.00 seconds, 0 Inserts)
% 0.87/1.07
% 0.87/1.07 Stopped by limit on number of solutions
% 0.87/1.07
% 0.87/1.07 Model 4 (0.00 seconds, 0 Inserts)
% 0.87/1.07
% 0.87/1.07 Stopped by limit on number of solutions
% 0.87/1.07
% 0.87/1.07 Model 5 (0.00 seconds, 0 Inserts)
% 0.87/1.07
% 0.87/1.07 Stopped by limit on number of solutions
% 0.87/1.07
% 0.87/1.07 Model 6 (0.00 seconds, 0 Inserts)
% 0.87/1.07
% 0.87/1.07 Stopped by limit on number of solutions
% 0.87/1.07
% 0.87/1.07 Resetting weight limit to 22 after 225 givens.
% 0.87/1.07
% 0.94/1.14
% 0.94/1.14
% 0.94/1.14 Changing weight limit from 22 to 21.
% 0.94/1.14
% 0.94/1.14 Resetting weight limit to 21 after 235 givens.
% 0.94/1.14
% 0.99/1.19
% 0.99/1.19
% 0.99/1.19 Changing weight limit from 21 to 20.
% 0.99/1.19
% 0.99/1.19 Resetting weight limit to 20 after 245 givens.
% 0.99/1.19
% 1.25/1.43
% 1.25/1.43
% 1.25/1.43 Changing weight limit from 20 to 19.
% 1.25/1.43
% 1.25/1.43 Resetting weight limit to 19 after 280 givens.
% 1.25/1.43
% 1.25/1.45
% 1.25/1.45
% 1.25/1.45 Changing weight limit from 19 to 18.
% 1.25/1.45
% 1.25/1.45 Resetting weight limit to 18 after 285 givens.
% 1.25/1.45
% 1.58/1.81
% 1.58/1.81
% 1.58/1.81 Changing weight limit from 18 to 17.
% 1.58/1.81
% 1.58/1.81 Resetting weight limit to 17 after 355 givens.
% 1.58/1.81
% 1.94/2.12
% 1.94/2.12
% 1.94/2.12 Changing weight limit from 17 to 16.
% 1.94/2.12
% 1.94/2.12 Resetting weight limit to 16 after 455 givens.
% 1.94/2.12
% 4.28/4.47
% 4.28/4.47 -------- PROOF --------
% 4.28/4.47 % SZS status Unsatisfiable
% 4.28/4.47 % SZS output start Refutation
% 4.28/4.47
% 4.28/4.47 Modelling stopped after 300 given clauses and 0.00 seconds
% 4.28/4.47
% 4.28/4.47
% 4.28/4.47 ----> UNIT CONFLICT at 3.86 sec ----> 37542 [binary,37541.1,2.1] {+} $F.
% 4.28/4.47
% 4.28/4.47 Length of proof is 25. Level of proof is 12.
% 4.28/4.47
% 4.28/4.47 ---------------- PROOF ----------------
% 4.28/4.47 % SZS status Unsatisfiable
% 4.28/4.47 % SZS output start Refutation
% 4.28/4.47
% 4.28/4.47 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 4.28/4.47 2 [] {+} -is_a_theorem(implies(not(a),implies(b,not(implies(b,a))))).
% 4.28/4.47 3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 4.28/4.47 4 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 4.28/4.47 5 [] {+} is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))).
% 4.28/4.47 6 [] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 4.28/4.47 9 [hyper,4,1,4] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 4.28/4.47 11 [hyper,4,1,6] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(not(B),not(A)),C))).
% 4.28/4.47 12 [hyper,4,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 4.28/4.47 15 [hyper,12,1,6] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 4.28/4.47 18 [hyper,15,1,4] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 4.28/4.47 20 [hyper,5,1,12] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 4.28/4.47 21 [hyper,5,1,4] {+} is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(implies(implies(B,A),A),C))).
% 4.28/4.47 27 [hyper,18,1,6] {-} is_a_theorem(implies(not(not(A)),implies(B,A))).
% 4.28/4.47 31 [hyper,27,1,4] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(not(B)),C))).
% 4.28/4.47 32 [hyper,27,1,3] {-} is_a_theorem(implies(A,implies(not(not(B)),implies(C,B)))).
% 4.28/4.47 59 [hyper,32,1,5] {-} is_a_theorem(implies(implies(implies(not(not(A)),implies(B,A)),C),C)).
% 4.28/4.47 66 [hyper,9,1,9] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 4.28/4.47 78 [hyper,20,1,4] {+} is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(A,C))).
% 4.28/4.47 307 [hyper,59,1,31] {+} is_a_theorem(implies(not(not(A)),A)).
% 4.28/4.47 327 [hyper,307,1,6] {+} is_a_theorem(implies(A,not(not(A)))).
% 4.28/4.47 328 [hyper,307,1,4] {+} is_a_theorem(implies(implies(A,B),implies(not(not(A)),B))).
% 4.28/4.47 349 [hyper,21,1,11] {-} is_a_theorem(implies(implies(implies(A,B),B),implies(implies(not(A),not(B)),A))).
% 4.28/4.47 359 [hyper,327,1,20] {+} is_a_theorem(implies(implies(implies(A,not(not(A))),B),B)).
% 4.28/4.47 1259 [hyper,349,1,12] {-} is_a_theorem(implies(A,implies(implies(not(B),not(A)),B))).
% 4.28/4.47 3751 [hyper,66,1,1259] {-} is_a_theorem(implies(implies(A,implies(not(B),not(C))),implies(C,implies(A,B)))).
% 4.28/4.47 9866 [hyper,359,1,9] {+} is_a_theorem(implies(implies(A,B),implies(A,not(not(B))))).
% 4.28/4.47 15998 [hyper,3751,1,328] {-} is_a_theorem(implies(A,implies(implies(B,not(A)),not(B)))).
% 4.28/4.47 16063 [hyper,15998,1,66] {-} is_a_theorem(implies(implies(A,implies(B,not(C))),implies(C,implies(A,not(B))))).
% 4.28/4.47 21347 [hyper,9866,1,78] {+} is_a_theorem(implies(A,implies(implies(A,B),not(not(B))))).
% 4.28/4.47 37541 [hyper,16063,1,21347] {-} is_a_theorem(implies(not(A),implies(B,not(implies(B,A))))).
% 4.28/4.47 37542 [binary,37541.1,2.1] {+} $F.
% 4.28/4.47
% 4.28/4.47 % SZS output end Refutation
% 4.28/4.47 ------------ end of proof -------------
% 4.28/4.47
% 4.28/4.47
% 4.28/4.47 Search stopped by max_proofs option.
% 4.28/4.47
% 4.28/4.47
% 4.28/4.47 Search stopped by max_proofs option.
% 4.28/4.47
% 4.28/4.47 ============ end of search ============
% 4.28/4.47
% 4.28/4.47 ----------- soft-scott stats ----------
% 4.28/4.47
% 4.28/4.47 true clauses given 468 (35.5%)
% 4.28/4.47 false clauses given 851
% 4.28/4.47
% 4.28/4.47 FALSE TRUE
% 4.28/4.47 11 0 15
% 4.28/4.47 12 0 431
% 4.28/4.47 13 0 879
% 4.28/4.47 14 428 1180
% 4.28/4.47 15 508 56
% 4.28/4.47 16 1594 60
% 4.28/4.47 tot: 2530 2621 (50.9% true)
% 4.28/4.47
% 4.28/4.47
% 4.28/4.47 Model 6 (0.00 seconds, 0 Inserts)
% 4.28/4.47
% 4.28/4.47 That finishes the proof of the theorem.
% 4.28/4.47
% 4.28/4.47 Process 13739 finished Sat Jul 2 21:47:04 2022
%------------------------------------------------------------------------------