%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL433-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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:30:11 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL433-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 08:19:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n013.cluster.edu,
% 0.12/0.35 Sun Jul 3 08:19:14 2022
% 0.12/0.35 The command was "./sos". The process ID is 22570.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/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: 6
% 0.19/0.38 number of clauses initially in problem: 8
% 0.19/0.38 percentage of clauses intially in UL: 75
% 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: 10
% 0.19/0.38 distinct predicate count: 2
% 0.19/0.38 distinct function count: 4
% 0.19/0.38 distinct constant count: 4
% 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 ===========
% 0.19/0.41
% 0.19/0.41 -------- PROOF --------
% 0.19/0.41 % SZS status Unsatisfiable
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41 ----> UNIT CONFLICT at 0.02 sec ----> 18 [binary,17.1,1.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 Length of proof is 5. Level of proof is 4.
% 0.19/0.41
% 0.19/0.41 ---------------- PROOF ----------------
% 0.19/0.41 % SZS status Unsatisfiable
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 1 [] {+} -c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 0.19/0.41 2 [] {+} c_in(A,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))| -c_PropLog_Osat(v_F,A,t_a).
% 0.19/0.41 3 [] {+} -c_PropLog_Osat(c_insert(A,B,tc_PropLog_Opl(C)),D,C)|c_PropLog_Osat(B,c_PropLog_Opl_Oop_A_N_62(A,D,C),C).
% 0.19/0.41 4 [] {+} -c_in(A,B,tc_PropLog_Opl(C))|c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)).
% 0.19/0.41 5 [] {+} -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))| -c_in(c_PropLog_Opl_Oop_A_N_62(A,D,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C))|c_in(D,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)).
% 0.19/0.41 6 [] {+} -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))|c_in(A,c_PropLog_Othms(c_insert(D,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)).
% 0.19/0.41 7 [] {-} c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a).
% 0.19/0.41 8 [] {+} c_in(A,c_insert(A,B,C),C).
% 0.19/0.41 9 [hyper,7,3] {-} c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),t_a).
% 0.19/0.41 10 [hyper,8,4] {+} c_in(A,c_PropLog_Othms(c_insert(A,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)).
% 0.19/0.41 11 [hyper,9,2] {-} c_in(c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)).
% 0.19/0.41 12 [hyper,11,6] {-} c_in(c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),c_PropLog_Othms(c_insert(A,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 0.19/0.41 17 [hyper,12,5,10] {-} c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 0.19/0.41 18 [binary,17.1,1.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 % SZS output end Refutation
% 0.19/0.41 ------------ end of proof -------------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41 ============ end of search ============
% 0.19/0.41
% 0.19/0.41 ----------- soft-scott stats ----------
% 0.19/0.41
% 0.19/0.41 true clauses given 1 (16.7%)
% 0.19/0.41 false clauses given 5
% 0.19/0.41
% 0.19/0.41 FALSE TRUE
% 0.19/0.41 12 1 0
% 0.19/0.41 13 0 1
% 0.19/0.41 15 0 1
% 0.19/0.41 tot: 1 2 (66.7% true)
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 That finishes the proof of the theorem.
% 0.19/0.41
% 0.19/0.41 Process 22570 finished Sun Jul 3 08:19:14 2022
%------------------------------------------------------------------------------