TSTP Solution File: LCL442-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL442-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:16 EDT 2022
% Result : Unsatisfiable 0.81s 1.01s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL442-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n028.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 10:17:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox on n028.cluster.edu,
% 0.12/0.34 Sun Jul 3 10:17:48 2022
% 0.12/0.34 The command was "./sos". The process ID is 13884.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.12/0.34
% 0.12/0.34 This is a non-Horn set without equality. The strategy
% 0.12/0.34 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.34 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: set(factor).
% 0.12/0.34 dependent: set(unit_deletion).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.81/1.01
% 0.81/1.01 Stopped by limit on insertions
% 0.81/1.01
% 0.81/1.01 Stopped by limit on insertions
% 0.81/1.01
% 0.81/1.01 Stopped by limit on insertions
% 0.81/1.01
% 0.81/1.01 Stopped by limit on insertions
% 0.81/1.01
% 0.81/1.01 Stopped by limit on insertions
% 0.81/1.01
% 0.81/1.01
% 0.81/1.01 Failed to model usable list: disabling FINDER
% 0.81/1.01
% 0.81/1.01
% 0.81/1.01
% 0.81/1.01 -------------- Softie stats --------------
% 0.81/1.01
% 0.81/1.01 UPDATE_STOP: 300
% 0.81/1.01 SFINDER_TIME_LIMIT: 2
% 0.81/1.01 SHORT_CLAUSE_CUTOFF: 4
% 0.81/1.01 number of clauses in intial UL: 11
% 0.81/1.01 number of clauses initially in problem: 13
% 0.81/1.01 percentage of clauses intially in UL: 84
% 0.81/1.01 percentage of distinct symbols occuring in initial UL: 100
% 0.81/1.01 percent of all initial clauses that are short: 92
% 0.81/1.01 absolute distinct symbol count: 12
% 0.81/1.01 distinct predicate count: 2
% 0.81/1.01 distinct function count: 5
% 0.81/1.01 distinct constant count: 5
% 0.81/1.01
% 0.81/1.01 ---------- no more Softie stats ----------
% 0.81/1.01
% 0.81/1.01
% 0.81/1.01
% 0.81/1.01 =========== start of search ===========
% 0.81/1.01
% 0.81/1.01 -------- PROOF --------
% 0.81/1.01 % SZS status Unsatisfiable
% 0.81/1.01 % SZS output start Refutation
% 0.81/1.01
% 0.81/1.01 -----> EMPTY CLAUSE at 0.64 sec ----> 316 [hyper,303,4,297] {-} $F.
% 0.81/1.01
% 0.81/1.01 Length of proof is 12. Level of proof is 10.
% 0.81/1.01
% 0.81/1.01 ---------------- PROOF ----------------
% 0.81/1.01 % SZS status Unsatisfiable
% 0.81/1.01 % SZS output start Refutation
% 0.81/1.01
% 0.81/1.01 1 [] {+} c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))| -c_PropLog_Oeval(v_tt,v_pl1,t_a).
% 0.81/1.01 2 [] {+} c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))| -c_PropLog_Oeval(v_tt,v_pl2,t_a).
% 0.81/1.01 3 [] {+} c_PropLog_Oeval(v_tt,v_pl1,t_a)| -c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 0.81/1.01 4 [] {+} -c_PropLog_Oeval(v_tt,v_pl2,t_a)| -c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 0.81/1.01 5 [] {+} -c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))|c_PropLog_Oeval(v_tt,v_pl2,t_a)| -c_PropLog_Oeval(v_tt,v_pl1,t_a).
% 0.81/1.01 6 [] {+} -c_in(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Ofalse,B),c_PropLog_Othms(C,B),tc_PropLog_Opl(B))|c_in(c_PropLog_Opl_Oop_A_N_62(A,D,B),c_PropLog_Othms(C,B),tc_PropLog_Opl(B)).
% 0.81/1.01 7 [] {+} -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))| -c_in(c_PropLog_Opl_Oop_A_N_62(D,c_PropLog_Opl_Ofalse,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C))|c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(A,D,C),c_PropLog_Opl_Ofalse,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C)).
% 0.81/1.01 8 [] {+} -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))|c_in(A,c_PropLog_Othms(c_union(B,D,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)).
% 0.81/1.01 9 [] {+} -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))|c_in(A,c_PropLog_Othms(c_union(D,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)).
% 0.81/1.01 10 [] {+} -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))|c_in(c_PropLog_Opl_Oop_A_N_62(D,A,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C)).
% 0.81/1.01 12 [] {-} c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))|c_PropLog_Oeval(v_tt,v_pl1,t_a).
% 0.81/1.01 13 [] {-} c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))|c_PropLog_Oeval(v_tt,v_pl2,t_a).
% 0.81/1.01 18 [hyper,12,6] {-} c_PropLog_Oeval(v_tt,v_pl1,t_a)|c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,A,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)).
% 0.81/1.01 23 [hyper,13,6] {-} c_PropLog_Oeval(v_tt,v_pl2,t_a)|c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,A,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)).
% 0.81/1.01 26 [hyper,18,8] {-} c_PropLog_Oeval(v_tt,v_pl1,t_a)|c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,A,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),B,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 0.81/1.01 29 [hyper,23,9] {-} c_PropLog_Oeval(v_tt,v_pl2,t_a)|c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,A,t_a),c_PropLog_Othms(c_union(B,c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 0.81/1.01 48 [hyper,26,3,factor_simp] {-} c_PropLog_Oeval(v_tt,v_pl1,t_a).
% 0.81/1.01 49 [hyper,48,1] {-} c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)).
% 0.81/1.01 52 [hyper,49,8] {-} c_in(v_pl1,c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),A,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 0.81/1.01 64 [hyper,52,7,29] {-} c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))|c_PropLog_Oeval(v_tt,v_pl2,t_a).
% 0.81/1.01 297 [hyper,64,5,48,factor_simp] {-} c_PropLog_Oeval(v_tt,v_pl2,t_a).
% 0.81/1.01 298 [hyper,297,2] {-} c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)).
% 0.81/1.01 299 [hyper,298,10] {-} c_in(c_PropLog_Opl_Oop_A_N_62(A,v_pl2,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)).
% 0.81/1.01 303 [hyper,299,9] {-} c_in(c_PropLog_Opl_Oop_A_N_62(A,v_pl2,t_a),c_PropLog_Othms(c_union(B,c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 0.81/1.01 316 [hyper,303,4,297] {-} $F.
% 0.81/1.01
% 0.81/1.01 % SZS output end Refutation
% 0.81/1.01 ------------ end of proof -------------
% 0.81/1.01
% 0.81/1.01
% 0.81/1.01 Search stopped by max_proofs option.
% 0.81/1.01
% 0.81/1.01
% 0.81/1.01 Search stopped by max_proofs option.
% 0.81/1.01
% 0.81/1.01 ============ end of search ============
% 0.81/1.01
% 0.81/1.01 That finishes the proof of the theorem.
% 0.81/1.01
% 0.81/1.01 Process 13884 finished Sun Jul 3 10:17:49 2022
%------------------------------------------------------------------------------