%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL010-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:20 EDT 2022
% Result : Unsatisfiable 36.53s 36.80s
% Output : Refutation 36.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL010-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 07:07:32 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox on n010.cluster.edu,
% 0.19/0.35 Mon Jul 4 07:07:32 2022
% 0.19/0.35 The command was "./sos". The process ID is 26629.
% 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: 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: 5
% 0.19/0.38 distinct predicate count: 1
% 0.19/0.38 distinct function count: 1
% 0.19/0.38 distinct constant count: 3
% 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 ===========
% 36.53/36.80
% 36.53/36.80 -- HEY sandbox, WE HAVE A PROOF!! --
% 36.53/36.80
% 36.53/36.80 Model 2 (0.00 seconds, 0 Inserts)
% 36.53/36.80
% 36.53/36.80 Stopped by limit on number of solutions
% 36.53/36.80
% 36.53/36.80 Model 3 (0.00 seconds, 0 Inserts)
% 36.53/36.80
% 36.53/36.80 Stopped by limit on number of solutions
% 36.53/36.80
% 36.53/36.80 Model 4 [ 1 358 194669 ] (0.00 seconds, 196832 Inserts)
% 36.53/36.80
% 36.53/36.80 Model 5 [ 3 0 949 ] (0.00 seconds, 193481 Inserts)
% 36.53/36.80
% 36.53/36.80 Model 6 [ 2 0 491 ] (0.00 seconds, 194196 Inserts)
% 36.53/36.80
% 36.53/36.80 Model 7 [ 2 0 664 ] (0.00 seconds, 196020 Inserts)
% 36.53/36.80
% 36.53/36.80 Model 8 [ 6 1 545 ] (0.00 seconds, 196672 Inserts)
% 36.53/36.80
% 36.53/36.80 Model 9 [ 3 357 194093 ] (0.00 seconds, 196782 Inserts)
% 36.53/36.80
% 36.53/36.80 Model 10 [ 7 0 502 ] (0.00 seconds, 197038 Inserts)
% 36.53/36.80
% 36.53/36.80 Model 11 [ 6 0 922 ] (0.00 seconds, 194636 Inserts)
% 36.53/36.80
% 36.53/36.80 ----> UNIT CONFLICT at 36.41 sec ----> 803 [binary,802.1,2.1] {-} $F.
% 36.53/36.80
% 36.53/36.80 Length of proof is 9. Level of proof is 8.
% 36.53/36.80
% 36.53/36.80 ---------------- PROOF ----------------
% 36.53/36.80 % SZS status Unsatisfiable
% 36.53/36.80 % SZS output start Refutation
% 36.53/36.80
% 36.53/36.80 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 36.53/36.80 2 [] {+} -is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(a,c)))).
% 36.53/36.80 3 [] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(C,B)))).
% 36.53/36.80 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(C,equivalent(equivalent(A,D),equivalent(D,B))))).
% 36.53/36.80 7 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(B,C)),equivalent(equivalent(A,D),equivalent(D,C)))).
% 36.53/36.80 8 [hyper,7,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(A,A),B),equivalent(B,equivalent(C,C)))).
% 36.53/36.80 12 [hyper,8,1,8] {-} is_a_theorem(equivalent(equivalent(equivalent(A,A),equivalent(B,B)),equivalent(C,C))).
% 36.53/36.80 33 [hyper,12,1,12] {+} is_a_theorem(equivalent(A,A)).
% 36.53/36.80 40 [hyper,33,1,7] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))).
% 36.53/36.80 59 [hyper,40,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(C,equivalent(B,A)))).
% 36.53/36.80 66 [hyper,40,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(B,C)),equivalent(A,C))).
% 36.53/36.80 802 [hyper,66,1,59] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,B),equivalent(A,C)))).
% 36.53/36.80 803 [binary,802.1,2.1] {-} $F.
% 36.53/36.80
% 36.53/36.80 % SZS output end Refutation
% 36.53/36.80 ------------ end of proof -------------
% 36.53/36.80
% 36.53/36.80
% 36.53/36.80 Search stopped by max_proofs option.
% 36.53/36.80
% 36.53/36.80
% 36.53/36.80 Search stopped by max_proofs option.
% 36.53/36.80
% 36.53/36.80 ============ end of search ============
% 36.53/36.80
% 36.53/36.80 ----------- soft-scott stats ----------
% 36.53/36.80
% 36.53/36.80 true clauses given 3 (7.0%)
% 36.53/36.80 false clauses given 40
% 36.53/36.80
% 36.53/36.80 FALSE TRUE
% 36.53/36.80 12 118 55
% 36.53/36.80 16 258 57
% 36.53/36.80 20 165 8
% 36.53/36.80 24 81 0
% 36.53/36.80 28 9 0
% 36.53/36.80 tot: 631 120 (16.0% true)
% 36.53/36.80
% 36.53/36.80
% 36.53/36.80 Model 11 [ 6 0 922 ] (0.00 seconds, 194636 Inserts)
% 36.53/36.80
% 36.53/36.80 That finishes the proof of the theorem.
% 36.53/36.80
% 36.53/36.80 Process 26629 finished Mon Jul 4 07:08:09 2022
%------------------------------------------------------------------------------