TSTP Solution File: LCL095-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL095-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:53 EDT 2022
% Result : Unsatisfiable 7.12s 7.38s
% Output : Refutation 7.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL095-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n017.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 11:58:55 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 sandbox on n017.cluster.edu,
% 0.13/0.35 Sat Jul 2 11:58:55 2022
% 0.13/0.35 The command was "./sos". The process ID is 16756.
% 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.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 2
% 0.13/0.38 number of clauses initially in problem: 3
% 0.13/0.38 percentage of clauses intially in UL: 66
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 4
% 0.13/0.38 distinct predicate count: 1
% 0.13/0.38 distinct function count: 1
% 0.13/0.38 distinct constant count: 2
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 7.12/7.38
% 7.12/7.38 -------- PROOF --------
% 7.12/7.38 % SZS status Unsatisfiable
% 7.12/7.38 % SZS output start Refutation
% 7.12/7.38
% 7.12/7.38 Model 2 (0.00 seconds, 0 Inserts)
% 7.12/7.38
% 7.12/7.38 Stopped by limit on number of solutions
% 7.12/7.38
% 7.12/7.38 Model 3 (0.00 seconds, 0 Inserts)
% 7.12/7.38
% 7.12/7.38 Stopped by limit on number of solutions
% 7.12/7.38
% 7.12/7.38 Model 4 (0.00 seconds, 0 Inserts)
% 7.12/7.38
% 7.12/7.38 Stopped by limit on number of solutions
% 7.12/7.38
% 7.12/7.38 Model 5 [ 1 4 11743 ] (0.00 seconds, 12248 Inserts)
% 7.12/7.38
% 7.12/7.38 Model 6 [ 1 1 586 ] (0.00 seconds, 17676 Inserts)
% 7.12/7.38
% 7.12/7.38 ----> UNIT CONFLICT at 6.97 sec ----> 2078 [binary,2077.1,2.1] {-} $F.
% 7.12/7.38
% 7.12/7.38 Length of proof is 35. Level of proof is 25.
% 7.12/7.38
% 7.12/7.38 ---------------- PROOF ----------------
% 7.12/7.38 % SZS status Unsatisfiable
% 7.12/7.38 % SZS output start Refutation
% 7.12/7.38
% 7.12/7.38 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 7.12/7.38 2 [] {+} -is_a_theorem(implies(a,implies(implies(a,b),b))).
% 7.12/7.38 3 [] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(implies(D,A),implies(E,implies(C,A))))).
% 7.12/7.38 4 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(C,D)),implies(E,implies(implies(F,C),implies(C,D))))).
% 7.12/7.38 5 [hyper,4,1,4] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(implies(D,E),implies(E,C)))))).
% 7.12/7.38 6 [hyper,4,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(B,C)),implies(D,implies(E,B))),implies(F,implies(G,implies(D,implies(E,B)))))).
% 7.12/7.38 7 [hyper,5,1,5] {-} is_a_theorem(implies(implies(A,B),implies(B,implies(implies(C,D),implies(D,B))))).
% 7.12/7.38 11 [hyper,7,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(B,C)),D),implies(E,implies(C,D)))).
% 7.12/7.38 18 [hyper,11,1,3] {-} is_a_theorem(implies(implies(implies(A,B),implies(implies(C,D),implies(D,A))),implies(E,implies(F,implies(implies(C,D),implies(D,A)))))).
% 7.12/7.38 21 [hyper,11,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(B,C),implies(D,implies(E,C)))))).
% 7.12/7.38 23 [hyper,6,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,implies(C,D))),implies(implies(E,D),implies(D,F))),implies(G,implies(H,implies(implies(E,D),implies(D,F)))))).
% 7.12/7.38 54 [hyper,18,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(C,D),implies(D,implies(D,D)))))).
% 7.12/7.38 56 [hyper,21,1,21] {-} is_a_theorem(implies(A,implies(implies(A,B),implies(C,implies(D,B))))).
% 7.12/7.38 58 [hyper,21,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,implies(D,B))),E),implies(F,implies(A,E)))).
% 7.12/7.38 63 [hyper,56,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(E,implies(implies(implies(D,F),C),D)))).
% 7.12/7.38 87 [hyper,23,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(implies(C,D),D),implies(D,implies(E,D)))))).
% 7.12/7.38 106 [hyper,54,1,54] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(C,C))))).
% 7.12/7.38 109 [hyper,106,1,106] {-} is_a_theorem(implies(implies(A,B),implies(B,implies(B,B)))).
% 7.12/7.38 114 [hyper,109,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,implies(A,B)))).
% 7.12/7.38 122 [hyper,114,1,3] {-} is_a_theorem(implies(implies(implies(A,B),implies(A,A)),implies(C,implies(D,implies(A,A))))).
% 7.12/7.38 272 [hyper,87,1,87] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),C),implies(C,implies(D,C))))).
% 7.12/7.38 277 [hyper,272,1,272] {-} is_a_theorem(implies(implies(implies(A,B),B),implies(B,implies(C,B)))).
% 7.12/7.38 371 [hyper,122,1,114] {-} is_a_theorem(implies(A,implies(B,implies(implies(C,C),implies(C,C))))).
% 7.12/7.38 378 [hyper,371,1,371] {+} is_a_theorem(implies(A,implies(implies(B,B),implies(B,B)))).
% 7.12/7.38 387 [hyper,378,1,378] {+} is_a_theorem(implies(implies(A,A),implies(A,A))).
% 7.12/7.38 400 [hyper,387,1,122] {+} is_a_theorem(implies(A,implies(B,implies(C,C)))).
% 7.12/7.38 477 [hyper,400,1,400] {+} is_a_theorem(implies(A,implies(B,B))).
% 7.12/7.38 525 [hyper,477,1,3] {+} is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))).
% 7.12/7.38 704 [hyper,525,1,3] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(C,implies(D,A)))).
% 7.12/7.38 733 [hyper,704,1,63] {-} is_a_theorem(implies(A,implies(B,implies(C,implies(implies(implies(D,E),D),D))))).
% 7.12/7.38 752 [hyper,733,1,733] {-} is_a_theorem(implies(A,implies(B,implies(implies(implies(C,D),C),C)))).
% 7.12/7.38 762 [hyper,752,1,752] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 7.12/7.38 779 [hyper,762,1,762] {+} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 7.12/7.38 781 [hyper,779,1,277] {+} is_a_theorem(implies(A,implies(B,A))).
% 7.12/7.38 785 [hyper,779,1,58] {-} is_a_theorem(implies(implies(A,B),implies(A,implies(C,B)))).
% 7.12/7.38 792 [hyper,785,1,781] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(B,implies(D,C))))).
% 7.12/7.38 922 [hyper,792,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(E,implies(implies(A,C),D)))).
% 7.12/7.38 2077 [hyper,922,1,779] {-} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 7.12/7.38 2078 [binary,2077.1,2.1] {-} $F.
% 7.12/7.38
% 7.12/7.38 % SZS output end Refutation
% 7.12/7.38 ------------ end of proof -------------
% 7.12/7.38
% 7.12/7.38
% 7.12/7.38 Search stopped by max_proofs option.
% 7.12/7.38
% 7.12/7.38
% 7.12/7.38 Search stopped by max_proofs option.
% 7.12/7.38
% 7.12/7.38 ============ end of search ============
% 7.12/7.38
% 7.12/7.38 ----------- soft-scott stats ----------
% 7.12/7.38
% 7.12/7.38 true clauses given 21 (11.2%)
% 7.12/7.38 false clauses given 167
% 7.12/7.38
% 7.12/7.38 FALSE TRUE
% 7.12/7.38 16 46 5
% 7.12/7.38 18 113 3
% 7.12/7.38 20 180 3
% 7.12/7.38 22 209 3
% 7.12/7.38 24 234 3
% 7.12/7.38 26 232 2
% 7.12/7.38 28 160 0
% 7.12/7.39 30 88 0
% 7.12/7.39 32 53 0
% 7.12/7.39 34 54 0
% 7.12/7.39 36 29 0
% 7.12/7.39 38 41 0
% 7.12/7.39 40 24 0
% 7.12/7.39 42 30 0
% 7.12/7.39 44 13 0
% 7.12/7.39 46 8 0
% 7.12/7.39 48 4 0
% 7.12/7.39 50 1 0
% 7.12/7.39 52 2 0
% 7.12/7.39 54 1 0
% 7.12/7.39 tot: 1522 19 (1.2% true)
% 7.12/7.39
% 7.12/7.39
% 7.12/7.39 Model 6 [ 1 1 586 ] (0.00 seconds, 17676 Inserts)
% 7.12/7.39
% 7.12/7.39 That finishes the proof of the theorem.
% 7.12/7.39
% 7.12/7.39 Process 16756 finished Sat Jul 2 11:59:02 2022
%------------------------------------------------------------------------------