%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL091-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:52 EDT 2022
% Result : Unsatisfiable 1.87s 2.05s
% Output : Refutation 1.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL091-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.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 15:35:20 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 sandbox2 on n026.cluster.edu,
% 0.13/0.36 Sat Jul 2 15:35:20 2022
% 0.13/0.36 The command was "./sos". The process ID is 3377.
% 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.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: 3
% 0.19/0.38 percentage of clauses intially in UL: 66
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 4
% 0.19/0.38 distinct predicate count: 1
% 0.19/0.38 distinct function count: 1
% 0.19/0.38 distinct constant count: 2
% 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 ===========
% 1.87/2.05
% 1.87/2.05 -------- PROOF --------
% 1.87/2.05 % SZS status Unsatisfiable
% 1.87/2.05 % SZS output start Refutation
% 1.87/2.05
% 1.87/2.05 Model 2 (0.00 seconds, 0 Inserts)
% 1.87/2.05
% 1.87/2.05 Stopped by limit on number of solutions
% 1.87/2.05
% 1.87/2.05 Model 3 (0.00 seconds, 0 Inserts)
% 1.87/2.05
% 1.87/2.05 Stopped by limit on number of solutions
% 1.87/2.05
% 1.87/2.05 Model 4 (0.00 seconds, 0 Inserts)
% 1.87/2.05
% 1.87/2.05 Stopped by limit on number of solutions
% 1.87/2.05
% 1.87/2.05 Model 5 [ 2 0 190 ] (0.00 seconds, 21391 Inserts)
% 1.87/2.05
% 1.87/2.05 ----> UNIT CONFLICT at 1.67 sec ----> 540 [binary,539.1,2.1] {-} $F.
% 1.87/2.05
% 1.87/2.05 Length of proof is 19. Level of proof is 19.
% 1.87/2.05
% 1.87/2.05 ---------------- PROOF ----------------
% 1.87/2.05 % SZS status Unsatisfiable
% 1.87/2.05 % SZS output start Refutation
% 1.87/2.05
% 1.87/2.05 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.87/2.05 2 [] {+} -is_a_theorem(implies(a,implies(b,a))).
% 1.87/2.05 3 [] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(implies(D,A),implies(E,implies(C,A))))).
% 1.87/2.05 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))))).
% 1.87/2.05 5 [hyper,4,1,4] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(implies(D,E),implies(E,C)))))).
% 1.87/2.05 7 [hyper,5,1,5] {-} is_a_theorem(implies(implies(A,B),implies(B,implies(implies(C,D),implies(D,B))))).
% 1.87/2.05 11 [hyper,7,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(B,C)),D),implies(E,implies(C,D)))).
% 1.87/2.05 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)))))).
% 1.87/2.05 54 [hyper,18,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(C,D),implies(D,implies(D,D)))))).
% 1.87/2.05 106 [hyper,54,1,54] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(C,C))))).
% 1.87/2.05 109 [hyper,106,1,106] {-} is_a_theorem(implies(implies(A,B),implies(B,implies(B,B)))).
% 1.87/2.05 114 [hyper,109,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,implies(A,B)))).
% 1.87/2.05 122 [hyper,114,1,3] {-} is_a_theorem(implies(implies(implies(A,B),implies(A,A)),implies(C,implies(D,implies(A,A))))).
% 1.87/2.05 371 [hyper,122,1,114] {-} is_a_theorem(implies(A,implies(B,implies(implies(C,C),implies(C,C))))).
% 1.87/2.05 378 [hyper,371,1,371] {+} is_a_theorem(implies(A,implies(implies(B,B),implies(B,B)))).
% 1.87/2.05 387 [hyper,378,1,378] {+} is_a_theorem(implies(implies(A,A),implies(A,A))).
% 1.87/2.05 400 [hyper,387,1,122] {+} is_a_theorem(implies(A,implies(B,implies(C,C)))).
% 1.87/2.05 447 [hyper,400,1,400] {+} is_a_theorem(implies(A,implies(B,B))).
% 1.87/2.05 487 [hyper,447,1,447] {+} is_a_theorem(implies(A,A)).
% 1.87/2.05 504 [hyper,487,1,4] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(D,C))))).
% 1.87/2.05 524 [hyper,504,1,504] {-} is_a_theorem(implies(implies(A,B),implies(B,implies(C,B)))).
% 1.87/2.05 539 [hyper,524,1,487] {-} is_a_theorem(implies(A,implies(B,A))).
% 1.87/2.05 540 [binary,539.1,2.1] {-} $F.
% 1.87/2.05
% 1.87/2.05 % SZS output end Refutation
% 1.87/2.05 ------------ end of proof -------------
% 1.87/2.05
% 1.87/2.05
% 1.87/2.05 Search stopped by max_proofs option.
% 1.87/2.05
% 1.87/2.05
% 1.87/2.05 Search stopped by max_proofs option.
% 1.87/2.05
% 1.87/2.05 ============ end of search ============
% 1.87/2.05
% 1.87/2.05 ----------- soft-scott stats ----------
% 1.87/2.05
% 1.87/2.05 true clauses given 5 (6.5%)
% 1.87/2.05 false clauses given 72
% 1.87/2.05
% 1.87/2.05 FALSE TRUE
% 1.87/2.05 10 0 1
% 1.87/2.05 12 1 2
% 1.87/2.05 14 5 2
% 1.87/2.05 16 10 2
% 1.87/2.05 18 21 2
% 1.87/2.05 20 30 1
% 1.87/2.05 22 39 1
% 1.87/2.05 24 40 3
% 1.87/2.05 26 25 4
% 1.87/2.05 28 15 2
% 1.87/2.05 30 11 1
% 1.87/2.05 32 8 0
% 1.87/2.05 34 4 0
% 1.87/2.05 36 4 0
% 1.87/2.05 38 2 0
% 1.87/2.05 40 2 0
% 1.87/2.05 42 1 0
% 1.87/2.05 tot: 218 21 (8.8% true)
% 1.87/2.05
% 1.87/2.05
% 1.87/2.05 Model 5 [ 2 0 190 ] (0.00 seconds, 21391 Inserts)
% 1.87/2.05
% 1.87/2.05 That finishes the proof of the theorem.
% 1.87/2.05
% 1.87/2.05 Process 3377 finished Sat Jul 2 15:35:22 2022
%------------------------------------------------------------------------------