TSTP Solution File: LAT270-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT270-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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 : 300s
% DateTime : Wed Jul 27 13:02:16 EDT 2022
% Result : Unsatisfiable 1.67s 1.87s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-4 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_lesse_quals(v_S,v_A,tc_set(t_a)),
file('LAT270-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_in(A,v_A,t_a)
| ~ c_in(B,v_A,t_a)
| ~ c_lesse_quals(C,c_Tarski_Ointerval(v_r,B,A,t_a),tc_set(t_a))
| c_lesse_quals(C,v_A,tc_set(t_a)) ),
file('LAT270-2.p',unknown),
[] ).
cnf(3,axiom,
c_in(v_a,v_A,t_a),
file('LAT270-2.p',unknown),
[] ).
cnf(4,axiom,
c_in(v_b,v_A,t_a),
file('LAT270-2.p',unknown),
[] ).
cnf(5,axiom,
c_lesse_quals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file('LAT270-2.p',unknown),
[] ).
cnf(6,plain,
c_lesse_quals(v_S,v_A,tc_set(t_a)),
inference(hyper,[status(thm)],[5,2,4,3]),
[iquote('hyper,5,2,4,3')] ).
cnf(7,plain,
$false,
inference(binary,[status(thm)],[6,1]),
[iquote('binary,6.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : LAT270-2 : TPTP v8.1.0. Released v3.2.0.
% 0.09/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 08:10:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.67/1.87 ----- Otter 3.3f, August 2004 -----
% 1.67/1.87 The process was started by sandbox2 on n012.cluster.edu,
% 1.67/1.87 Wed Jul 27 08:10:20 2022
% 1.67/1.87 The command was "./otter". The process ID is 27012.
% 1.67/1.87
% 1.67/1.87 set(prolog_style_variables).
% 1.67/1.87 set(auto).
% 1.67/1.87 dependent: set(auto1).
% 1.67/1.87 dependent: set(process_input).
% 1.67/1.87 dependent: clear(print_kept).
% 1.67/1.87 dependent: clear(print_new_demod).
% 1.67/1.87 dependent: clear(print_back_demod).
% 1.67/1.87 dependent: clear(print_back_sub).
% 1.67/1.87 dependent: set(control_memory).
% 1.67/1.87 dependent: assign(max_mem, 12000).
% 1.67/1.87 dependent: assign(pick_given_ratio, 4).
% 1.67/1.87 dependent: assign(stats_level, 1).
% 1.67/1.87 dependent: assign(max_seconds, 10800).
% 1.67/1.87 clear(print_given).
% 1.67/1.87
% 1.67/1.87 list(usable).
% 1.67/1.87 0 [] c_in(v_a,v_A,t_a).
% 1.67/1.87 0 [] c_in(v_b,v_A,t_a).
% 1.67/1.87 0 [] c_lesse_quals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)).
% 1.67/1.87 0 [] -c_lesse_quals(v_S,v_A,tc_set(t_a)).
% 1.67/1.87 0 [] -c_in(V_b,v_A,t_a)| -c_in(V_a,v_A,t_a)| -c_lesse_quals(V_S,c_Tarski_Ointerval(v_r,V_a,V_b,t_a),tc_set(t_a))|c_lesse_quals(V_S,v_A,tc_set(t_a)).
% 1.67/1.87 end_of_list.
% 1.67/1.87
% 1.67/1.87 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.67/1.87
% 1.67/1.87 This is a Horn set without equality. The strategy will
% 1.67/1.87 be hyperresolution, with satellites in sos and nuclei
% 1.67/1.87 in usable.
% 1.67/1.87
% 1.67/1.87 dependent: set(hyper_res).
% 1.67/1.87 dependent: clear(order_hyper).
% 1.67/1.87
% 1.67/1.87 ------------> process usable:
% 1.67/1.87 ** KEPT (pick-wt=5): 1 [] -c_lesse_quals(v_S,v_A,tc_set(t_a)).
% 1.67/1.87 ** KEPT (pick-wt=22): 2 [] -c_in(A,v_A,t_a)| -c_in(B,v_A,t_a)| -c_lesse_quals(C,c_Tarski_Ointerval(v_r,B,A,t_a),tc_set(t_a))|c_lesse_quals(C,v_A,tc_set(t_a)).
% 1.67/1.87
% 1.67/1.87 ------------> process sos:
% 1.67/1.87 ** KEPT (pick-wt=4): 3 [] c_in(v_a,v_A,t_a).
% 1.67/1.87 ** KEPT (pick-wt=4): 4 [] c_in(v_b,v_A,t_a).
% 1.67/1.87 ** KEPT (pick-wt=9): 5 [] c_lesse_quals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)).
% 1.67/1.87
% 1.67/1.87 ======= end of input processing =======
% 1.67/1.87
% 1.67/1.87 =========== start of search ===========
% 1.67/1.87
% 1.67/1.87 -------- PROOF --------
% 1.67/1.87
% 1.67/1.87 ----> UNIT CONFLICT at 0.00 sec ----> 7 [binary,6.1,1.1] $F.
% 1.67/1.87
% 1.67/1.87 Length of proof is 1. Level of proof is 1.
% 1.67/1.87
% 1.67/1.87 ---------------- PROOF ----------------
% 1.67/1.87 % SZS status Unsatisfiable
% 1.67/1.87 % SZS output start Refutation
% See solution above
% 1.67/1.87 ------------ end of proof -------------
% 1.67/1.87
% 1.67/1.87
% 1.67/1.87 Search stopped by max_proofs option.
% 1.67/1.87
% 1.67/1.87
% 1.67/1.87 Search stopped by max_proofs option.
% 1.67/1.87
% 1.67/1.87 ============ end of search ============
% 1.67/1.87
% 1.67/1.87 -------------- statistics -------------
% 1.67/1.87 clauses given 3
% 1.67/1.87 clauses generated 1
% 1.67/1.87 clauses kept 6
% 1.67/1.87 clauses forward subsumed 0
% 1.67/1.87 clauses back subsumed 0
% 1.67/1.87 Kbytes malloced 976
% 1.67/1.87
% 1.67/1.87 ----------- times (seconds) -----------
% 1.67/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.87 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.67/1.87
% 1.67/1.87 That finishes the proof of the theorem.
% 1.67/1.87
% 1.67/1.87 Process 27012 finished Wed Jul 27 08:10:22 2022
% 1.67/1.87 Otter interrupted
% 1.67/1.87 PROOF FOUND
%------------------------------------------------------------------------------