TSTP Solution File: SYN075+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN075+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:23:30 EDT 2022
% Result : Theorem 1.63s 1.85s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 15 ( 5 unt; 6 nHn; 9 RR)
% Number of literals : 29 ( 19 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ big_f(A,B)
| A = dollar_c2 ),
file('SYN075+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big_f(A,B)
| B = dollar_c1 ),
file('SYN075+1.p',unknown),
[] ).
cnf(3,axiom,
( big_f(A,B)
| A != dollar_c2
| B != dollar_c1 ),
file('SYN075+1.p',unknown),
[] ).
cnf(5,axiom,
( big_f(A,dollar_f3(B))
| A != dollar_f1(B)
| dollar_f3(B) = B ),
file('SYN075+1.p',unknown),
[] ).
cnf(6,axiom,
( big_f(dollar_f2(A,B),dollar_f3(A))
| dollar_f2(A,B) = B
| dollar_f3(A) != A ),
file('SYN075+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ big_f(dollar_f2(A,B),dollar_f3(A))
| dollar_f2(A,B) != B
| dollar_f3(A) != A ),
file('SYN075+1.p',unknown),
[] ).
cnf(8,axiom,
A = A,
file('SYN075+1.p',unknown),
[] ).
cnf(9,plain,
( big_f(dollar_f1(A),dollar_f3(A))
| dollar_f3(A) = A ),
inference(hyper,[status(thm)],[8,5]),
[iquote('hyper,8,5')] ).
cnf(10,plain,
big_f(dollar_c2,dollar_c1),
inference(hyper,[status(thm)],[8,3,8]),
[iquote('hyper,8,3,8')] ).
cnf(21,plain,
( dollar_f3(A) = A
| dollar_f3(A) = dollar_c1 ),
inference(hyper,[status(thm)],[9,2]),
[iquote('hyper,9,2')] ).
cnf(24,plain,
dollar_f3(dollar_c1) = dollar_c1,
inference(factor,[status(thm)],[21]),
[iquote('factor,21.1.2')] ).
cnf(53,plain,
( big_f(dollar_f2(dollar_c1,A),dollar_c1)
| dollar_f2(dollar_c1,A) = A ),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[24,6]),24]),
[iquote('hyper,23,6,demod,24')] ).
cnf(167,plain,
( dollar_f2(dollar_c1,A) = A
| dollar_f2(dollar_c1,A) = dollar_c2 ),
inference(hyper,[status(thm)],[53,1]),
[iquote('hyper,53,1')] ).
cnf(169,plain,
dollar_f2(dollar_c1,dollar_c2) = dollar_c2,
inference(factor,[status(thm)],[167]),
[iquote('factor,167.1.2')] ).
cnf(193,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[169,7]),169,24,24]),10,8,8]),
[iquote('para_from,168.1.1,7.2.1,demod,169,24,24,unit_del,10,8,8')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN075+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 11:14:39 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.63/1.85 ----- Otter 3.3f, August 2004 -----
% 1.63/1.85 The process was started by sandbox2 on n010.cluster.edu,
% 1.63/1.85 Wed Jul 27 11:14:39 2022
% 1.63/1.85 The command was "./otter". The process ID is 9085.
% 1.63/1.85
% 1.63/1.85 set(prolog_style_variables).
% 1.63/1.85 set(auto).
% 1.63/1.85 dependent: set(auto1).
% 1.63/1.85 dependent: set(process_input).
% 1.63/1.85 dependent: clear(print_kept).
% 1.63/1.85 dependent: clear(print_new_demod).
% 1.63/1.85 dependent: clear(print_back_demod).
% 1.63/1.85 dependent: clear(print_back_sub).
% 1.63/1.85 dependent: set(control_memory).
% 1.63/1.85 dependent: assign(max_mem, 12000).
% 1.63/1.85 dependent: assign(pick_given_ratio, 4).
% 1.63/1.85 dependent: assign(stats_level, 1).
% 1.63/1.85 dependent: assign(max_seconds, 10800).
% 1.63/1.85 clear(print_given).
% 1.63/1.85
% 1.63/1.85 formula_list(usable).
% 1.63/1.85 all A (A=A).
% 1.63/1.85 exists Z W all X Y (big_f(X,Y)<->X=Z&Y=W).
% 1.63/1.85 -(exists W all Y ((exists Z all X (big_f(X,Y)<->X=Z))<->Y=W)).
% 1.63/1.85 end_of_list.
% 1.63/1.85
% 1.63/1.85 -------> usable clausifies to:
% 1.63/1.85
% 1.63/1.85 list(usable).
% 1.63/1.85 0 [] A=A.
% 1.63/1.85 0 [] -big_f(X,Y)|X=$c2.
% 1.63/1.85 0 [] -big_f(X,Y)|Y=$c1.
% 1.63/1.85 0 [] big_f(X,Y)|X!=$c2|Y!=$c1.
% 1.63/1.85 0 [] -big_f(X,$f3(W))|X=$f1(W)|$f3(W)=W.
% 1.63/1.85 0 [] big_f(X,$f3(W))|X!=$f1(W)|$f3(W)=W.
% 1.63/1.85 0 [] big_f($f2(W,Z),$f3(W))|$f2(W,Z)=Z|$f3(W)!=W.
% 1.63/1.85 0 [] -big_f($f2(W,Z),$f3(W))|$f2(W,Z)!=Z|$f3(W)!=W.
% 1.63/1.85 end_of_list.
% 1.63/1.85
% 1.63/1.85 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.63/1.85
% 1.63/1.85 This ia a non-Horn set with equality. The strategy will be
% 1.63/1.85 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.63/1.85 deletion, with positive clauses in sos and nonpositive
% 1.63/1.85 clauses in usable.
% 1.63/1.85
% 1.63/1.85 dependent: set(knuth_bendix).
% 1.63/1.85 dependent: set(anl_eq).
% 1.63/1.85 dependent: set(para_from).
% 1.63/1.85 dependent: set(para_into).
% 1.63/1.85 dependent: clear(para_from_right).
% 1.63/1.85 dependent: clear(para_into_right).
% 1.63/1.85 dependent: set(para_from_vars).
% 1.63/1.85 dependent: set(eq_units_both_ways).
% 1.63/1.85 dependent: set(dynamic_demod_all).
% 1.63/1.85 dependent: set(dynamic_demod).
% 1.63/1.85 dependent: set(order_eq).
% 1.63/1.85 dependent: set(back_demod).
% 1.63/1.85 dependent: set(lrpo).
% 1.63/1.85 dependent: set(hyper_res).
% 1.63/1.85 dependent: set(unit_deletion).
% 1.63/1.85 dependent: set(factor).
% 1.63/1.85
% 1.63/1.85 ------------> process usable:
% 1.63/1.85 ** KEPT (pick-wt=6): 1 [] -big_f(A,B)|A=$c2.
% 1.63/1.85 ** KEPT (pick-wt=6): 2 [] -big_f(A,B)|B=$c1.
% 1.63/1.85 ** KEPT (pick-wt=9): 3 [] big_f(A,B)|A!=$c2|B!=$c1.
% 1.63/1.85 ** KEPT (pick-wt=12): 4 [] -big_f(A,$f3(B))|A=$f1(B)|$f3(B)=B.
% 1.63/1.85 ** KEPT (pick-wt=12): 5 [] big_f(A,$f3(B))|A!=$f1(B)|$f3(B)=B.
% 1.63/1.85 ** KEPT (pick-wt=15): 6 [] big_f($f2(A,B),$f3(A))|$f2(A,B)=B|$f3(A)!=A.
% 1.63/1.85 ** KEPT (pick-wt=15): 7 [] -big_f($f2(A,B),$f3(A))|$f2(A,B)!=B|$f3(A)!=A.
% 1.63/1.85
% 1.63/1.85 ------------> process sos:
% 1.63/1.85 ** KEPT (pick-wt=3): 8 [] A=A.
% 1.63/1.85 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] A=A.
% 1.63/1.85
% 1.63/1.85 ======= end of input processing =======
% 1.63/1.85
% 1.63/1.85 =========== start of search ===========
% 1.63/1.85
% 1.63/1.85 -------- PROOF --------
% 1.63/1.85
% 1.63/1.85 -----> EMPTY CLAUSE at 0.01 sec ----> 193 [para_from,168.1.1,7.2.1,demod,169,24,24,unit_del,10,8,8] $F.
% 1.63/1.85
% 1.63/1.85 Length of proof is 7. Level of proof is 6.
% 1.63/1.85
% 1.63/1.85 ---------------- PROOF ----------------
% 1.63/1.85 % SZS status Theorem
% 1.63/1.85 % SZS output start Refutation
% See solution above
% 1.63/1.85 ------------ end of proof -------------
% 1.63/1.85
% 1.63/1.85
% 1.63/1.85 Search stopped by max_proofs option.
% 1.63/1.85
% 1.63/1.85
% 1.63/1.85 Search stopped by max_proofs option.
% 1.63/1.85
% 1.63/1.85 ============ end of search ============
% 1.63/1.85
% 1.63/1.85 -------------- statistics -------------
% 1.63/1.85 clauses given 22
% 1.63/1.85 clauses generated 685
% 1.63/1.85 clauses kept 190
% 1.63/1.85 clauses forward subsumed 496
% 1.63/1.85 clauses back subsumed 35
% 1.63/1.85 Kbytes malloced 976
% 1.63/1.85
% 1.63/1.85 ----------- times (seconds) -----------
% 1.63/1.85 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.63/1.85 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.63/1.85 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.63/1.85
% 1.63/1.85 That finishes the proof of the theorem.
% 1.63/1.85
% 1.63/1.85 Process 9085 finished Wed Jul 27 11:14:41 2022
% 1.63/1.85 Otter interrupted
% 1.63/1.85 PROOF FOUND
%------------------------------------------------------------------------------