TSTP Solution File: LAT273-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT273-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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 06:46:36 EDT 2022
% Result : Unsatisfiable 1.09s 1.32s
% Output : Refutation 1.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT273-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n023.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 : Wed Jun 29 17:43:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n023.cluster.edu,
% 0.12/0.35 Wed Jun 29 17:43:29 2022
% 0.12/0.35 The command was "./sos". The process ID is 18570.
% 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=0, equality=0, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 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 =======
% 1.09/1.32
% 1.09/1.32 Stopped by limit on insertions
% 1.09/1.32
% 1.09/1.32 Stopped by limit on insertions
% 1.09/1.32
% 1.09/1.32 Stopped by limit on insertions
% 1.09/1.32
% 1.09/1.32 Stopped by limit on insertions
% 1.09/1.32
% 1.09/1.32 Stopped by limit on insertions
% 1.09/1.32
% 1.09/1.32
% 1.09/1.32 Failed to model usable list: disabling FINDER
% 1.09/1.32
% 1.09/1.32
% 1.09/1.32
% 1.09/1.32 -------------- Softie stats --------------
% 1.09/1.32
% 1.09/1.32 UPDATE_STOP: 300
% 1.09/1.32 SFINDER_TIME_LIMIT: 2
% 1.09/1.32 SHORT_CLAUSE_CUTOFF: 4
% 1.09/1.32 number of clauses in intial UL: 4
% 1.09/1.32 number of clauses initially in problem: 7
% 1.09/1.32 percentage of clauses intially in UL: 57
% 1.09/1.32 percentage of distinct symbols occuring in initial UL: 87
% 1.09/1.32 percent of all initial clauses that are short: 85
% 1.09/1.32 absolute distinct symbol count: 16
% 1.09/1.32 distinct predicate count: 3
% 1.09/1.32 distinct function count: 5
% 1.09/1.32 distinct constant count: 8
% 1.09/1.32
% 1.09/1.32 ---------- no more Softie stats ----------
% 1.09/1.32
% 1.09/1.32
% 1.09/1.32
% 1.09/1.32 =========== start of search ===========
% 1.09/1.32
% 1.09/1.32 -------- PROOF --------
% 1.09/1.32 % SZS status Unsatisfiable
% 1.09/1.32 % SZS output start Refutation
% 1.09/1.32
% 1.09/1.32 ----> UNIT CONFLICT at 0.93 sec ----> 11 [binary,10.1,4.1] {-} $F.
% 1.09/1.32
% 1.09/1.32 Length of proof is 3. Level of proof is 3.
% 1.09/1.32
% 1.09/1.32 ---------------- PROOF ----------------
% 1.09/1.32 % SZS status Unsatisfiable
% 1.09/1.32 % SZS output start Refutation
% 1.09/1.32
% 1.09/1.32 1 [] {+} -c_in(A,B,C)| -c_lessequals(B,c_Tarski_Ointerval(D,E,F,C),tc_set(C))|c_in(c_Pair(A,F,C,C),D,tc_prod(C,C)).
% 1.09/1.32 2 [] {+} -c_Tarski_OisLub(A,v_cl,B,t_a)| -c_in(C,v_A,t_a)|c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mi(A,v_r,C),A,t_a).
% 1.09/1.32 3 [] {+} -c_Tarski_OisLub(A,v_cl,B,t_a)| -c_in(C,v_A,t_a)| -c_in(c_Pair(v_sko__4mi(A,v_r,C),C,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.09/1.32 4 [] {+} -c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.09/1.32 5 [] {-} c_in(v_b,v_A,t_a).
% 1.09/1.32 6 [] {-} c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)).
% 1.09/1.32 7 [] {-} c_Tarski_OisLub(v_S,v_cl,v_L,t_a).
% 1.09/1.32 8 [hyper,7,2,5,unit_del,4] {-} c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a).
% 1.09/1.32 9 [hyper,6,1,8] {-} c_in(c_Pair(v_sko__4mi(v_S,v_r,v_b),v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.09/1.32 10 [hyper,9,3,7,5] {-} c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.09/1.32 11 [binary,10.1,4.1] {-} $F.
% 1.09/1.32
% 1.09/1.32 % SZS output end Refutation
% 1.09/1.32 ------------ end of proof -------------
% 1.09/1.32
% 1.09/1.32
% 1.09/1.32 Search stopped by max_proofs option.
% 1.09/1.32
% 1.09/1.32
% 1.09/1.32 Search stopped by max_proofs option.
% 1.09/1.32
% 1.09/1.32 ============ end of search ============
% 1.09/1.32
% 1.09/1.32 That finishes the proof of the theorem.
% 1.09/1.32
% 1.09/1.32 Process 18570 finished Wed Jun 29 17:43:30 2022
%------------------------------------------------------------------------------