TSTP Solution File: LCL089-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL089-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:51 EDT 2022
% Result : Unsatisfiable 20.92s 21.12s
% Output : Refutation 20.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL089-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 4 19:36:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n026.cluster.edu,
% 0.13/0.35 Mon Jul 4 19:36:52 2022
% 0.13/0.35 The command was "./sos". The process ID is 4235.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set without equality. The strategy will
% 0.13/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35 in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.20/0.37
% 0.20/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.37
% 0.20/0.37 Stopped by limit on number of solutions
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 -------------- Softie stats --------------
% 0.20/0.37
% 0.20/0.37 UPDATE_STOP: 300
% 0.20/0.37 SFINDER_TIME_LIMIT: 2
% 0.20/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.37 number of clauses in intial UL: 2
% 0.20/0.37 number of clauses initially in problem: 3
% 0.20/0.37 percentage of clauses intially in UL: 66
% 0.20/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.37 percent of all initial clauses that are short: 100
% 0.20/0.37 absolute distinct symbol count: 5
% 0.20/0.37 distinct predicate count: 1
% 0.20/0.37 distinct function count: 1
% 0.20/0.37 distinct constant count: 3
% 0.20/0.37
% 0.20/0.37 ---------- no more Softie stats ----------
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 =========== start of search ===========
% 20.92/21.12
% 20.92/21.12 -- HEY sandbox2, WE HAVE A PROOF!! --
% 20.92/21.12
% 20.92/21.12 Model 2 (0.00 seconds, 0 Inserts)
% 20.92/21.12
% 20.92/21.12 Stopped by limit on number of solutions
% 20.92/21.12
% 20.92/21.12 Model 3 (0.00 seconds, 0 Inserts)
% 20.92/21.12
% 20.92/21.12 Stopped by limit on number of solutions
% 20.92/21.12
% 20.92/21.12 Model 4 (0.00 seconds, 0 Inserts)
% 20.92/21.12
% 20.92/21.12 Stopped by limit on number of solutions
% 20.92/21.12
% 20.92/21.12 Model 5 (0.00 seconds, 0 Inserts)
% 20.92/21.12
% 20.92/21.12 Stopped by limit on number of solutions
% 20.92/21.12
% 20.92/21.12 Model 6 [ 2 330 189851 ] (0.00 seconds, 194705 Inserts)
% 20.92/21.12
% 20.92/21.12 Model 7 [ 2 1 689 ] (0.00 seconds, 181062 Inserts)
% 20.92/21.12
% 20.92/21.12 Model 8 [ 3 1 241 ] (0.00 seconds, 187478 Inserts)
% 20.92/21.12
% 20.92/21.12 Model 9 [ 4 1 936 ] (0.00 seconds, 185048 Inserts)
% 20.92/21.12
% 20.92/21.12 ----> UNIT CONFLICT at 20.73 sec ----> 1029 [binary,1028.1,2.1] {-} $F.
% 20.92/21.12
% 20.92/21.12 Length of proof is 30. Level of proof is 19.
% 20.92/21.12
% 20.92/21.12 ---------------- PROOF ----------------
% 20.92/21.12 % SZS status Unsatisfiable
% 20.92/21.12 % SZS output start Refutation
% 20.92/21.12
% 20.92/21.12 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 20.92/21.12 2 [] {+} -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))).
% 20.92/21.12 3 [] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(E,implies(implies(D,A),implies(C,A))))).
% 20.92/21.12 4 [hyper,3,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(implies(B,C),implies(D,C)),implies(C,E)),implies(F,implies(C,E))))).
% 20.92/21.12 5 [hyper,4,1,4] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))).
% 20.92/21.12 7 [hyper,5,1,5] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))).
% 20.92/21.12 9 [hyper,5,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(B,C),implies(D,C))))).
% 20.92/21.12 10 [hyper,7,1,7] {+} is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))).
% 20.92/21.12 12 [hyper,10,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(C,B)))).
% 20.92/21.12 20 [hyper,9,1,9] {-} is_a_theorem(implies(A,implies(implies(A,B),implies(C,B)))).
% 20.92/21.12 21 [hyper,9,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(implies(B,C),implies(D,C)),E),implies(B,E)))).
% 20.92/21.12 23 [hyper,20,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),D),implies(implies(implies(D,E),C),D)))).
% 20.92/21.12 32 [hyper,12,1,12] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(B,A))).
% 20.92/21.12 37 [hyper,32,1,5] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 20.92/21.12 52 [hyper,37,1,37] {+} is_a_theorem(implies(A,implies(B,A))).
% 20.92/21.12 55 [hyper,37,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),D),implies(C,D)))).
% 20.92/21.12 56 [hyper,55,1,55] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 20.92/21.12 62 [hyper,56,1,3] {-} is_a_theorem(implies(implies(A,B),implies(C,implies(implies(B,D),implies(A,D))))).
% 20.92/21.12 71 [hyper,52,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(D,B)))).
% 20.92/21.12 79 [hyper,71,1,71] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))).
% 20.92/21.12 85 [hyper,79,1,3] {-} is_a_theorem(implies(A,implies(implies(B,implies(B,C)),implies(D,implies(B,C))))).
% 20.92/21.12 128 [hyper,21,1,21] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(A,D))).
% 20.92/21.12 225 [hyper,23,1,23] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(C,D),B),C))).
% 20.92/21.12 480 [hyper,225,1,79] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 20.92/21.12 497 [hyper,480,1,480] {+} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 20.92/21.12 650 [hyper,85,1,497] {-} is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(A,B)))).
% 20.92/21.12 671 [hyper,650,1,650] {-} is_a_theorem(implies(A,implies(implies(B,implies(B,C)),implies(B,C)))).
% 20.92/21.12 673 [hyper,650,1,128] {-} is_a_theorem(implies(A,implies(B,implies(implies(A,C),C)))).
% 20.92/21.12 694 [hyper,673,1,650] {-} is_a_theorem(implies(A,implies(B,implies(implies(B,C),C)))).
% 20.92/21.12 797 [hyper,694,1,694] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 20.92/21.12 889 [hyper,797,1,52] {-} is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)).
% 20.92/21.12 1008 [hyper,671,1,889] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 20.92/21.12 1028 [hyper,1008,1,62] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 20.92/21.12 1029 [binary,1028.1,2.1] {-} $F.
% 20.92/21.12
% 20.92/21.12 % SZS output end Refutation
% 20.92/21.12 ------------ end of proof -------------
% 20.92/21.12
% 20.92/21.12
% 20.92/21.12 Search stopped by max_proofs option.
% 20.92/21.12
% 20.92/21.12
% 20.92/21.12 Search stopped by max_proofs option.
% 20.92/21.12
% 20.92/21.12 ============ end of search ============
% 20.92/21.12
% 20.92/21.12 ----------- soft-scott stats ----------
% 20.92/21.12
% 20.92/21.12 true clauses given 9 (10.2%)
% 20.92/21.12 false clauses given 79
% 20.92/21.12
% 20.92/21.13 FALSE TRUE
% 20.92/21.13 10 0 1
% 20.92/21.13 12 15 3
% 20.92/21.13 14 53 4
% 20.92/21.13 16 116 7
% 20.92/21.13 18 152 6
% 20.92/21.13 20 154 3
% 20.92/21.13 22 106 1
% 20.92/21.13 24 78 0
% 20.92/21.13 26 39 0
% 20.92/21.13 28 32 0
% 20.92/21.13 30 28 0
% 20.92/21.13 32 33 0
% 20.92/21.13 34 29 0
% 20.92/21.13 36 22 0
% 20.92/21.13 38 10 0
% 20.92/21.13 40 4 0
% 20.92/21.13 tot: 871 25 (2.8% true)
% 20.92/21.13
% 20.92/21.13
% 20.92/21.13 Model 9 [ 4 1 936 ] (0.00 seconds, 185048 Inserts)
% 20.92/21.13
% 20.92/21.13 That finishes the proof of the theorem.
% 20.92/21.13
% 20.92/21.13 Process 4235 finished Mon Jul 4 19:37:13 2022
%------------------------------------------------------------------------------