TSTP Solution File: LCL429-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL429-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:09 EDT 2022
% Result : Unsatisfiable 0.76s 0.96s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL429-2 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n011.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 : Sat Jul 2 11:32:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox2 on n011.cluster.edu,
% 0.18/0.35 Sat Jul 2 11:32:34 2022
% 0.18/0.35 The command was "./sos". The process ID is 11454.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.18/0.35
% 0.18/0.35 This is a Horn set without equality. The strategy will
% 0.18/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.18/0.35 in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: clear(order_hyper).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.76/0.96
% 0.76/0.96 Stopped by limit on insertions
% 0.76/0.96
% 0.76/0.96 Stopped by limit on insertions
% 0.76/0.96
% 0.76/0.96 Stopped by limit on insertions
% 0.76/0.96
% 0.76/0.96 Stopped by limit on insertions
% 0.76/0.96
% 0.76/0.96 Stopped by limit on insertions
% 0.76/0.96
% 0.76/0.96
% 0.76/0.96 Failed to model usable list: disabling FINDER
% 0.76/0.96
% 0.76/0.96
% 0.76/0.96
% 0.76/0.96 -------------- Softie stats --------------
% 0.76/0.96
% 0.76/0.96 UPDATE_STOP: 300
% 0.76/0.96 SFINDER_TIME_LIMIT: 2
% 0.76/0.96 SHORT_CLAUSE_CUTOFF: 4
% 0.76/0.96 number of clauses in intial UL: 4
% 0.76/0.96 number of clauses initially in problem: 8
% 0.76/0.96 percentage of clauses intially in UL: 50
% 0.76/0.96 percentage of distinct symbols occuring in initial UL: 94
% 0.76/0.96 percent of all initial clauses that are short: 87
% 0.76/0.96 absolute distinct symbol count: 17
% 0.76/0.96 distinct predicate count: 2
% 0.76/0.96 distinct function count: 8
% 0.76/0.96 distinct constant count: 7
% 0.76/0.96
% 0.76/0.96 ---------- no more Softie stats ----------
% 0.76/0.96
% 0.76/0.96
% 0.76/0.96
% 0.76/0.96 =========== start of search ===========
% 0.76/0.96
% 0.76/0.96 -------- PROOF --------
% 0.76/0.96 % SZS status Unsatisfiable
% 0.76/0.96 % SZS output start Refutation
% 0.76/0.96
% 0.76/0.96 ----> UNIT CONFLICT at 0.59 sec ----> 14 [binary,13.1,4.1] {+} $F.
% 0.76/0.96
% 0.76/0.96 Length of proof is 4. Level of proof is 3.
% 0.76/0.96
% 0.76/0.96 ---------------- PROOF ----------------
% 0.76/0.96 % SZS status Unsatisfiable
% 0.76/0.96 % SZS output start Refutation
% 0.76/0.96
% 0.76/0.96 1 [] {+} -c_in(A,c_PropLog_Othms(c_minus(B,C,tc_set(tc_PropLog_Opl(D))),D),tc_PropLog_Opl(D))| -c_lessequals(B,E,tc_set(tc_PropLog_Opl(D)))|c_in(A,c_PropLog_Othms(c_minus(E,C,tc_set(tc_PropLog_Opl(D))),D),tc_PropLog_Opl(D)).
% 0.76/0.96 2 [] {+} -c_in(A,c_PropLog_Othms(c_insert(B,C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D))| -c_in(A,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(B,c_PropLog_Opl_Ofalse,D),C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D))|c_in(A,c_PropLog_Othms(C,D),tc_PropLog_Opl(D)).
% 0.76/0.96 3 [] {+} -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))| -c_lessequals(B,D,tc_set(tc_PropLog_Opl(C)))|c_in(A,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)).
% 0.76/0.96 4 [] {+} -c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Ovar(v_v,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)).
% 0.76/0.96 5 [] {-} c_lessequals(c_PropLog_Ohyps(A,c_minus(B,c_insert(C,c_emptyset,D),tc_set(D)),D),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(C,D),c_PropLog_Opl_Ofalse,D),c_minus(c_PropLog_Ohyps(A,B,D),c_insert(c_PropLog_Opl_Ovar(C,D),c_emptyset,tc_PropLog_Opl(D)),tc_set(tc_PropLog_Opl(D))),tc_PropLog_Opl(D)),tc_set(tc_PropLog_Opl(D))).
% 0.76/0.96 6 [] {-} c_lessequals(c_minus(A,B,tc_set(C)),c_insert(D,c_minus(A,c_insert(D,B,C),tc_set(C)),C),tc_set(C)).
% 0.76/0.96 7 [] {-} c_lessequals(c_minus(c_insert(A,c_minus(B,c_insert(C,c_emptyset,D),tc_set(D)),D),E,tc_set(D)),c_insert(A,c_minus(B,c_insert(C,E,D),tc_set(D)),D),tc_set(D)).
% 0.76/0.96 8 [] {-} c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,A,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)).
% 0.76/0.96 9 [hyper,8,1,5] {-} c_in(v_p,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(A,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,B,t_a),c_insert(c_PropLog_Opl_Ovar(A,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)).
% 0.76/0.96 10 [hyper,6,3,8] {-} c_in(v_p,c_PropLog_Othms(c_insert(A,c_minus(c_PropLog_Ohyps(v_p,B,t_a),c_insert(A,v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 0.76/0.96 11 [hyper,9,3,7] {-} c_in(v_p,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(A,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,B,t_a),c_insert(c_PropLog_Opl_Ovar(A,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 0.76/0.96 13 [hyper,11,2,10] {-} c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,A,t_a),c_insert(c_PropLog_Opl_Ovar(B,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)).
% 0.76/0.96 14 [binary,13.1,4.1] {+} $F.
% 0.76/0.96
% 0.76/0.96 % SZS output end Refutation
% 0.76/0.96 ------------ end of proof -------------
% 0.76/0.96
% 0.76/0.96
% 0.76/0.96 Search stopped by max_proofs option.
% 0.76/0.96
% 0.76/0.96
% 0.76/0.96 Search stopped by max_proofs option.
% 0.76/0.96
% 0.76/0.96 ============ end of search ============
% 0.76/0.96
% 0.76/0.96 That finishes the proof of the theorem.
% 0.76/0.96
% 0.76/0.96 Process 11454 finished Sat Jul 2 11:32:35 2022
%------------------------------------------------------------------------------