TSTP Solution File: SET047+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET047+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:12:55 EDT 2022
% Result : Theorem 1.79s 2.03s
% Output : Refutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of clauses : 26 ( 7 unt; 15 nHn; 25 RR)
% Number of literals : 56 ( 0 equ; 8 neg)
% Maximal clause size : 4 ( 2 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,
( ~ set_e_qual(A,B)
| ~ element(C,A)
| element(C,B) ),
file('SET047+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ set_e_qual(A,B)
| element(C,A)
| ~ element(C,B) ),
file('SET047+1.p',unknown),
[] ).
cnf(3,axiom,
( set_e_qual(A,B)
| ~ element(dollar_f1(A,B),A)
| ~ element(dollar_f1(A,B),B) ),
file('SET047+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ set_e_qual(dollar_c2,dollar_c1)
| ~ set_e_qual(dollar_c1,dollar_c2) ),
file('SET047+1.p',unknown),
[] ).
cnf(6,axiom,
( set_e_qual(A,B)
| element(dollar_f1(A,B),A)
| element(dollar_f1(A,B),B) ),
file('SET047+1.p',unknown),
[] ).
cnf(7,axiom,
( set_e_qual(dollar_c2,dollar_c1)
| set_e_qual(dollar_c1,dollar_c2) ),
file('SET047+1.p',unknown),
[] ).
cnf(9,plain,
( element(dollar_f1(dollar_c1,dollar_c2),dollar_c1)
| element(dollar_f1(dollar_c1,dollar_c2),dollar_c2)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c2)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c1) ),
inference(hyper,[status(thm)],[6,4,6]),
[iquote('hyper,6,4,6')] ).
cnf(11,plain,
( element(dollar_f1(dollar_c1,dollar_c2),dollar_c2)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c2)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c1) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[9,2,6])])])]),
[iquote('hyper,9,2,6,factor_simp,factor_simp,factor_simp')] ).
cnf(14,plain,
( element(dollar_f1(dollar_c1,dollar_c2),dollar_c1)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c2)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c1) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[9,1,6])])])]),
[iquote('hyper,9,1,6,factor_simp,factor_simp,factor_simp')] ).
cnf(22,plain,
( element(dollar_f1(dollar_c1,dollar_c2),dollar_c2)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c1)
| set_e_qual(dollar_c2,dollar_c1) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[11,2,7])]),
[iquote('hyper,11,2,7,factor_simp')] ).
cnf(26,plain,
( element(dollar_f1(dollar_c1,dollar_c2),dollar_c2)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c2)
| set_e_qual(dollar_c1,dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[11,2,7])]),
[iquote('hyper,11,2,7,factor_simp')] ).
cnf(30,plain,
( element(dollar_f1(dollar_c2,dollar_c1),dollar_c2)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c1)
| set_e_qual(dollar_c1,dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[14,3,11])])]),
[iquote('hyper,14,3,11,factor_simp,factor_simp')] ).
cnf(41,plain,
( element(dollar_f1(dollar_c1,dollar_c2),dollar_c2)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c1) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[22,1,11])])])]),
[iquote('hyper,22,1,11,factor_simp,factor_simp,factor_simp')] ).
cnf(46,plain,
( element(dollar_f1(dollar_c1,dollar_c2),dollar_c2)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[26,1,41])])]),
[iquote('hyper,26,1,41,factor_simp,factor_simp')] ).
cnf(49,plain,
( element(dollar_f1(dollar_c1,dollar_c2),dollar_c2)
| set_e_qual(dollar_c2,dollar_c1) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[46,3,41])]),
[iquote('hyper,46,3,41,factor_simp')] ).
cnf(52,plain,
( element(dollar_f1(dollar_c2,dollar_c1),dollar_c2)
| element(dollar_f1(dollar_c2,dollar_c1),dollar_c1) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[30,4,6])])]),
[iquote('hyper,30,4,6,factor_simp,factor_simp')] ).
cnf(53,plain,
( element(dollar_f1(dollar_c1,dollar_c2),dollar_c2)
| element(dollar_f1(dollar_c1,dollar_c2),dollar_c1) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[49,4,6])]),
[iquote('hyper,49,4,6,factor_simp')] ).
cnf(54,plain,
( element(dollar_f1(dollar_c2,dollar_c1),dollar_c1)
| set_e_qual(dollar_c2,dollar_c1) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[52,2,7])]),
[iquote('hyper,52,2,7,factor_simp')] ).
cnf(58,plain,
( element(dollar_f1(dollar_c2,dollar_c1),dollar_c2)
| set_e_qual(dollar_c1,dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[52,2,7])]),
[iquote('hyper,52,2,7,factor_simp')] ).
cnf(62,plain,
element(dollar_f1(dollar_c2,dollar_c1),dollar_c1),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[54,1,52])])]),
[iquote('hyper,54,1,52,factor_simp,factor_simp')] ).
cnf(78,plain,
element(dollar_f1(dollar_c2,dollar_c1),dollar_c2),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[58,1,62])]),
[iquote('hyper,58,1,62,factor_simp')] ).
cnf(79,plain,
set_e_qual(dollar_c2,dollar_c1),
inference(hyper,[status(thm)],[78,3,62]),
[iquote('hyper,78,3,62')] ).
cnf(83,plain,
element(dollar_f1(dollar_c1,dollar_c2),dollar_c1),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[53,1,79])]),
[iquote('hyper,53,1,79,factor_simp')] ).
cnf(84,plain,
element(dollar_f1(dollar_c1,dollar_c2),dollar_c2),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[53,2,79])]),
[iquote('hyper,53,2,79,factor_simp')] ).
cnf(94,plain,
set_e_qual(dollar_c1,dollar_c2),
inference(hyper,[status(thm)],[84,3,83]),
[iquote('hyper,84,3,83')] ).
cnf(97,plain,
$false,
inference(hyper,[status(thm)],[94,4,79]),
[iquote('hyper,94,4,79')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET047+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:52:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.79/2.03 ----- Otter 3.3f, August 2004 -----
% 1.79/2.03 The process was started by sandbox on n025.cluster.edu,
% 1.79/2.03 Wed Jul 27 10:52:15 2022
% 1.79/2.03 The command was "./otter". The process ID is 15828.
% 1.79/2.03
% 1.79/2.03 set(prolog_style_variables).
% 1.79/2.03 set(auto).
% 1.79/2.03 dependent: set(auto1).
% 1.79/2.03 dependent: set(process_input).
% 1.79/2.03 dependent: clear(print_kept).
% 1.79/2.03 dependent: clear(print_new_demod).
% 1.79/2.03 dependent: clear(print_back_demod).
% 1.79/2.03 dependent: clear(print_back_sub).
% 1.79/2.03 dependent: set(control_memory).
% 1.79/2.03 dependent: assign(max_mem, 12000).
% 1.79/2.03 dependent: assign(pick_given_ratio, 4).
% 1.79/2.03 dependent: assign(stats_level, 1).
% 1.79/2.03 dependent: assign(max_seconds, 10800).
% 1.79/2.03 clear(print_given).
% 1.79/2.03
% 1.79/2.03 formula_list(usable).
% 1.79/2.03 all X Y (set_e_qual(X,Y)<-> (all Z (element(Z,X)<->element(Z,Y)))).
% 1.79/2.03 -(all X Y (set_e_qual(X,Y)<->set_e_qual(Y,X))).
% 1.79/2.03 end_of_list.
% 1.79/2.03
% 1.79/2.03 -------> usable clausifies to:
% 1.79/2.03
% 1.79/2.03 list(usable).
% 1.79/2.03 0 [] -set_e_qual(X,Y)| -element(Z,X)|element(Z,Y).
% 1.79/2.03 0 [] -set_e_qual(X,Y)|element(Z,X)| -element(Z,Y).
% 1.79/2.03 0 [] set_e_qual(X,Y)|element($f1(X,Y),X)|element($f1(X,Y),Y).
% 1.79/2.03 0 [] set_e_qual(X,Y)| -element($f1(X,Y),X)| -element($f1(X,Y),Y).
% 1.79/2.03 0 [] set_e_qual($c2,$c1)|set_e_qual($c1,$c2).
% 1.79/2.03 0 [] -set_e_qual($c2,$c1)| -set_e_qual($c1,$c2).
% 1.79/2.03 end_of_list.
% 1.79/2.03
% 1.79/2.03 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.79/2.03
% 1.79/2.03 This is a non-Horn set without equality. The strategy will
% 1.79/2.03 be ordered hyper_res, unit deletion, and factoring, with
% 1.79/2.03 satellites in sos and with nuclei in usable.
% 1.79/2.03
% 1.79/2.03 dependent: set(hyper_res).
% 1.79/2.03 dependent: set(factor).
% 1.79/2.03 dependent: set(unit_deletion).
% 1.79/2.03
% 1.79/2.03 ------------> process usable:
% 1.79/2.03 ** KEPT (pick-wt=9): 1 [] -set_e_qual(A,B)| -element(C,A)|element(C,B).
% 1.79/2.03 ** KEPT (pick-wt=9): 2 [] -set_e_qual(A,B)|element(C,A)| -element(C,B).
% 1.79/2.03 ** KEPT (pick-wt=13): 3 [] set_e_qual(A,B)| -element($f1(A,B),A)| -element($f1(A,B),B).
% 1.79/2.03 ** KEPT (pick-wt=6): 4 [] -set_e_qual($c2,$c1)| -set_e_qual($c1,$c2).
% 1.79/2.03
% 1.79/2.03 ------------> process sos:
% 1.79/2.03 ** KEPT (pick-wt=13): 6 [] set_e_qual(A,B)|element($f1(A,B),A)|element($f1(A,B),B).
% 1.79/2.03 ** KEPT (pick-wt=6): 7 [] set_e_qual($c2,$c1)|set_e_qual($c1,$c2).
% 1.79/2.03
% 1.79/2.03 ======= end of input processing =======
% 1.79/2.03
% 1.79/2.03 =========== start of search ===========
% 1.79/2.03
% 1.79/2.03 -------- PROOF --------
% 1.79/2.03
% 1.79/2.03 -----> EMPTY CLAUSE at 0.01 sec ----> 97 [hyper,94,4,79] $F.
% 1.79/2.03
% 1.79/2.03 Length of proof is 19. Level of proof is 10.
% 1.79/2.03
% 1.79/2.03 ---------------- PROOF ----------------
% 1.79/2.03 % SZS status Theorem
% 1.79/2.03 % SZS output start Refutation
% See solution above
% 1.79/2.03 ------------ end of proof -------------
% 1.79/2.03
% 1.79/2.03
% 1.79/2.03 Search stopped by max_proofs option.
% 1.79/2.03
% 1.79/2.03
% 1.79/2.03 Search stopped by max_proofs option.
% 1.79/2.03
% 1.79/2.03 ============ end of search ============
% 1.79/2.03
% 1.79/2.03 -------------- statistics -------------
% 1.79/2.03 clauses given 24
% 1.79/2.03 clauses generated 535
% 1.79/2.03 clauses kept 96
% 1.79/2.03 clauses forward subsumed 444
% 1.79/2.03 clauses back subsumed 68
% 1.79/2.03 Kbytes malloced 976
% 1.79/2.03
% 1.79/2.03 ----------- times (seconds) -----------
% 1.79/2.03 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.79/2.03 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.79/2.03 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.79/2.03
% 1.79/2.03 That finishes the proof of the theorem.
% 1.79/2.03
% 1.79/2.03 Process 15828 finished Wed Jul 27 10:52:17 2022
% 1.79/2.03 Otter interrupted
% 1.79/2.04 PROOF FOUND
%------------------------------------------------------------------------------