TSTP Solution File: SYN966+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN966+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:25:35 EDT 2022
% Result : Theorem 1.92s 2.11s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 6 unt; 2 nHn; 10 RR)
% Number of literals : 20 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ e_q(A,B)
| ~ a_member_of(C,A)
| a_member_of(C,B) ),
file('SYN966+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ e_q(A,B)
| a_member_of(C,A)
| ~ a_member_of(C,B) ),
file('SYN966+1.p',unknown),
[] ).
cnf(3,axiom,
( e_q(A,B)
| ~ a_member_of(dollar_f1(A,B),A)
| ~ a_member_of(dollar_f1(A,B),B) ),
file('SYN966+1.p',unknown),
[] ).
cnf(4,axiom,
~ e_q(dollar_c1,dollar_c2),
file('SYN966+1.p',unknown),
[] ).
cnf(6,axiom,
( e_q(A,B)
| a_member_of(dollar_f1(A,B),A)
| a_member_of(dollar_f1(A,B),B) ),
file('SYN966+1.p',unknown),
[] ).
cnf(7,axiom,
e_q(dollar_c2,dollar_c1),
file('SYN966+1.p',unknown),
[] ).
cnf(9,plain,
( a_member_of(dollar_f1(dollar_c1,dollar_c2),dollar_c1)
| a_member_of(dollar_f1(dollar_c1,dollar_c2),dollar_c2) ),
inference(hyper,[status(thm)],[6,4]),
[iquote('hyper,6,4')] ).
cnf(10,plain,
a_member_of(dollar_f1(dollar_c1,dollar_c2),dollar_c2),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[9,2,7])]),
[iquote('hyper,9,2,7,factor_simp')] ).
cnf(12,plain,
a_member_of(dollar_f1(dollar_c1,dollar_c2),dollar_c1),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[9,1,7])]),
[iquote('hyper,9,1,7,factor_simp')] ).
cnf(15,plain,
e_q(dollar_c1,dollar_c2),
inference(hyper,[status(thm)],[12,3,10]),
[iquote('hyper,12,3,10')] ).
cnf(16,plain,
$false,
inference(binary,[status(thm)],[15,4]),
[iquote('binary,15.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN966+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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 11:20:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.92/2.11 ----- Otter 3.3f, August 2004 -----
% 1.92/2.11 The process was started by sandbox on n015.cluster.edu,
% 1.92/2.11 Wed Jul 27 11:20:12 2022
% 1.92/2.11 The command was "./otter". The process ID is 23037.
% 1.92/2.11
% 1.92/2.11 set(prolog_style_variables).
% 1.92/2.11 set(auto).
% 1.92/2.11 dependent: set(auto1).
% 1.92/2.11 dependent: set(process_input).
% 1.92/2.11 dependent: clear(print_kept).
% 1.92/2.11 dependent: clear(print_new_demod).
% 1.92/2.11 dependent: clear(print_back_demod).
% 1.92/2.11 dependent: clear(print_back_sub).
% 1.92/2.11 dependent: set(control_memory).
% 1.92/2.11 dependent: assign(max_mem, 12000).
% 1.92/2.11 dependent: assign(pick_given_ratio, 4).
% 1.92/2.11 dependent: assign(stats_level, 1).
% 1.92/2.11 dependent: assign(max_seconds, 10800).
% 1.92/2.11 clear(print_given).
% 1.92/2.11
% 1.92/2.11 formula_list(usable).
% 1.92/2.11 -((all X Y (e_q(X,Y)<-> (all Z (a_member_of(Z,X)<->a_member_of(Z,Y)))))-> (all A B (e_q(A,B)->e_q(B,A)))).
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 -------> usable clausifies to:
% 1.92/2.11
% 1.92/2.11 list(usable).
% 1.92/2.11 0 [] -e_q(X,Y)| -a_member_of(Z,X)|a_member_of(Z,Y).
% 1.92/2.11 0 [] -e_q(X,Y)|a_member_of(Z,X)| -a_member_of(Z,Y).
% 1.92/2.11 0 [] e_q(X,Y)|a_member_of($f1(X,Y),X)|a_member_of($f1(X,Y),Y).
% 1.92/2.11 0 [] e_q(X,Y)| -a_member_of($f1(X,Y),X)| -a_member_of($f1(X,Y),Y).
% 1.92/2.11 0 [] e_q($c2,$c1).
% 1.92/2.11 0 [] -e_q($c1,$c2).
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.92/2.11
% 1.92/2.11 This is a non-Horn set without equality. The strategy will
% 1.92/2.11 be ordered hyper_res, unit deletion, and factoring, with
% 1.92/2.11 satellites in sos and with nuclei in usable.
% 1.92/2.11
% 1.92/2.11 dependent: set(hyper_res).
% 1.92/2.11 dependent: set(factor).
% 1.92/2.11 dependent: set(unit_deletion).
% 1.92/2.11
% 1.92/2.11 ------------> process usable:
% 1.92/2.11 ** KEPT (pick-wt=9): 1 [] -e_q(A,B)| -a_member_of(C,A)|a_member_of(C,B).
% 1.92/2.11 ** KEPT (pick-wt=9): 2 [] -e_q(A,B)|a_member_of(C,A)| -a_member_of(C,B).
% 1.92/2.11 ** KEPT (pick-wt=13): 3 [] e_q(A,B)| -a_member_of($f1(A,B),A)| -a_member_of($f1(A,B),B).
% 1.92/2.11 ** KEPT (pick-wt=3): 4 [] -e_q($c1,$c2).
% 1.92/2.11
% 1.92/2.11 ------------> process sos:
% 1.92/2.11 ** KEPT (pick-wt=13): 6 [] e_q(A,B)|a_member_of($f1(A,B),A)|a_member_of($f1(A,B),B).
% 1.92/2.11 ** KEPT (pick-wt=3): 7 [] e_q($c2,$c1).
% 1.92/2.11
% 1.92/2.11 ======= end of input processing =======
% 1.92/2.11
% 1.92/2.11 =========== start of search ===========
% 1.92/2.11
% 1.92/2.11 -------- PROOF --------
% 1.92/2.11
% 1.92/2.11 ----> UNIT CONFLICT at 0.00 sec ----> 16 [binary,15.1,4.1] $F.
% 1.92/2.11
% 1.92/2.11 Length of proof is 4. Level of proof is 3.
% 1.92/2.11
% 1.92/2.11 ---------------- PROOF ----------------
% 1.92/2.11 % SZS status Theorem
% 1.92/2.11 % SZS output start Refutation
% See solution above
% 1.92/2.11 ------------ end of proof -------------
% 1.92/2.11
% 1.92/2.11
% 1.92/2.11 Search stopped by max_proofs option.
% 1.92/2.11
% 1.92/2.11
% 1.92/2.11 Search stopped by max_proofs option.
% 1.92/2.11
% 1.92/2.11 ============ end of search ============
% 1.92/2.11
% 1.92/2.11 -------------- statistics -------------
% 1.92/2.11 clauses given 6
% 1.92/2.11 clauses generated 28
% 1.92/2.11 clauses kept 15
% 1.92/2.11 clauses forward subsumed 19
% 1.92/2.11 clauses back subsumed 2
% 1.92/2.11 Kbytes malloced 976
% 1.92/2.11
% 1.92/2.11 ----------- times (seconds) -----------
% 1.92/2.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.11 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.92/2.11
% 1.92/2.11 That finishes the proof of the theorem.
% 1.92/2.11
% 1.92/2.11 Process 23037 finished Wed Jul 27 11:20:13 2022
% 1.92/2.11 Otter interrupted
% 1.92/2.11 PROOF FOUND
%------------------------------------------------------------------------------