TSTP Solution File: SET824-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET824-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:14:19 EDT 2022
% Result : Unsatisfiable 1.64s 1.84s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 2
% Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR)
% Number of literals : 4 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 4 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c_in(A,B,C)
| ~ c_in(A,c_uminus(B,tc_set(C)),C) ),
file('SET824-2.p',unknown),
[] ).
cnf(2,axiom,
c_in(v_a,A,tc_IntDef_Oint),
file('SET824-2.p',unknown),
[] ).
cnf(3,plain,
$false,
inference(hyper,[status(thm)],[2,1,2]),
[iquote('hyper,2,1,2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET824-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 10:44:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.64/1.84 ----- Otter 3.3f, August 2004 -----
% 1.64/1.84 The process was started by sandbox2 on n027.cluster.edu,
% 1.64/1.84 Wed Jul 27 10:44:22 2022
% 1.64/1.84 The command was "./otter". The process ID is 13229.
% 1.64/1.84
% 1.64/1.84 set(prolog_style_variables).
% 1.64/1.84 set(auto).
% 1.64/1.84 dependent: set(auto1).
% 1.64/1.84 dependent: set(process_input).
% 1.64/1.84 dependent: clear(print_kept).
% 1.64/1.84 dependent: clear(print_new_demod).
% 1.64/1.84 dependent: clear(print_back_demod).
% 1.64/1.84 dependent: clear(print_back_sub).
% 1.64/1.84 dependent: set(control_memory).
% 1.64/1.84 dependent: assign(max_mem, 12000).
% 1.64/1.84 dependent: assign(pick_given_ratio, 4).
% 1.64/1.84 dependent: assign(stats_level, 1).
% 1.64/1.84 dependent: assign(max_seconds, 10800).
% 1.64/1.84 clear(print_given).
% 1.64/1.84
% 1.64/1.84 list(usable).
% 1.64/1.84 0 [] -c_in(V_c,V_A,T_a)| -c_in(V_c,c_uminus(V_A,tc_set(T_a)),T_a).
% 1.64/1.84 0 [] c_in(v_a,V_U,tc_IntDef_Oint).
% 1.64/1.84 end_of_list.
% 1.64/1.84
% 1.64/1.84 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 1.64/1.84
% 1.64/1.84 This is a Horn set without equality. The strategy will
% 1.64/1.84 be hyperresolution, with satellites in sos and nuclei
% 1.64/1.84 in usable.
% 1.64/1.84
% 1.64/1.84 dependent: set(hyper_res).
% 1.64/1.84 dependent: clear(order_hyper).
% 1.64/1.84
% 1.64/1.84 ------------> process usable:
% 1.64/1.84 ** KEPT (pick-wt=11): 1 [] -c_in(A,B,C)| -c_in(A,c_uminus(B,tc_set(C)),C).
% 1.64/1.84
% 1.64/1.84 ------------> process sos:
% 1.64/1.84 ** KEPT (pick-wt=4): 2 [] c_in(v_a,A,tc_IntDef_Oint).
% 1.64/1.84
% 1.64/1.84 ======= end of input processing =======
% 1.64/1.84
% 1.64/1.84 =========== start of search ===========
% 1.64/1.84
% 1.64/1.84 -------- PROOF --------
% 1.64/1.84
% 1.64/1.84 -----> EMPTY CLAUSE at 0.00 sec ----> 3 [hyper,2,1,2] $F.
% 1.64/1.84
% 1.64/1.84 Length of proof is 0. Level of proof is 0.
% 1.64/1.84
% 1.64/1.84 ---------------- PROOF ----------------
% 1.64/1.84 % SZS status Unsatisfiable
% 1.64/1.84 % SZS output start Refutation
% See solution above
% 1.64/1.84 ------------ end of proof -------------
% 1.64/1.84
% 1.64/1.84
% 1.64/1.84 Search stopped by max_proofs option.
% 1.64/1.84
% 1.64/1.84
% 1.64/1.84 Search stopped by max_proofs option.
% 1.64/1.84
% 1.64/1.84 ============ end of search ============
% 1.64/1.84
% 1.64/1.84 -------------- statistics -------------
% 1.64/1.84 clauses given 1
% 1.64/1.84 clauses generated 1
% 1.64/1.84 clauses kept 2
% 1.64/1.84 clauses forward subsumed 0
% 1.64/1.84 clauses back subsumed 0
% 1.64/1.84 Kbytes malloced 976
% 1.64/1.84
% 1.64/1.84 ----------- times (seconds) -----------
% 1.64/1.84 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.84 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.84 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.64/1.84
% 1.64/1.84 That finishes the proof of the theorem.
% 1.64/1.84
% 1.64/1.84 Process 13229 finished Wed Jul 27 10:44:23 2022
% 1.64/1.84 Otter interrupted
% 1.64/1.84 PROOF FOUND
%------------------------------------------------------------------------------