TSTP Solution File: SYN333+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN333+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n008.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:24:16 EDT 2022
% Result : Theorem 1.67s 1.88s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 3 unt; 0 nHn; 3 RR)
% Number of literals : 10 ( 0 equ; 6 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 : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 8 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ big_f(A,dollar_f1(B,A))
| ~ big_f(dollar_f1(B,A),dollar_f1(B,A))
| big_g(B,A) ),
file('SYN333+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big_f(A,dollar_f1(B,A))
| ~ big_f(dollar_f1(B,A),dollar_f1(B,A))
| ~ big_g(B,dollar_f1(B,A))
| ~ big_g(dollar_f1(B,A),dollar_f1(B,A)) ),
file('SYN333+1.p',unknown),
[] ).
cnf(3,axiom,
big_f(A,B),
file('SYN333+1.p',unknown),
[] ).
cnf(4,plain,
big_g(A,B),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,plain,
$false,
inference(hyper,[status(thm)],[4,2,3,3,4]),
[iquote('hyper,4,2,3,3,4')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN333+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n008.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:10:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.67/1.87 ----- Otter 3.3f, August 2004 -----
% 1.67/1.87 The process was started by sandbox2 on n008.cluster.edu,
% 1.67/1.87 Wed Jul 27 11:10:38 2022
% 1.67/1.87 The command was "./otter". The process ID is 13327.
% 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 formula_list(usable).
% 1.67/1.87 -(exists X Y all Z (big_f(X,Y)->big_f(Y,Z)&big_f(Z,Z)& (big_f(X,Y)&big_g(X,Y)->big_g(X,Z)&big_g(Z,Z)))).
% 1.67/1.87 end_of_list.
% 1.67/1.87
% 1.67/1.87 -------> usable clausifies to:
% 1.67/1.87
% 1.67/1.87 list(usable).
% 1.67/1.87 0 [] big_f(X,Y).
% 1.67/1.87 0 [] -big_f(Y,$f1(X,Y))| -big_f($f1(X,Y),$f1(X,Y))|big_g(X,Y).
% 1.67/1.87 0 [] -big_f(Y,$f1(X,Y))| -big_f($f1(X,Y),$f1(X,Y))| -big_g(X,$f1(X,Y))| -big_g($f1(X,Y),$f1(X,Y)).
% 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.88
% 1.67/1.88 This is a Horn set without equality. The strategy will
% 1.67/1.88 be hyperresolution, with satellites in sos and nuclei
% 1.67/1.88 in usable.
% 1.67/1.88
% 1.67/1.88 dependent: set(hyper_res).
% 1.67/1.88 dependent: clear(order_hyper).
% 1.67/1.88
% 1.67/1.88 ------------> process usable:
% 1.67/1.88 ** KEPT (pick-wt=15): 1 [] -big_f(A,$f1(B,A))| -big_f($f1(B,A),$f1(B,A))|big_g(B,A).
% 1.67/1.88 ** KEPT (pick-wt=24): 2 [] -big_f(A,$f1(B,A))| -big_f($f1(B,A),$f1(B,A))| -big_g(B,$f1(B,A))| -big_g($f1(B,A),$f1(B,A)).
% 1.67/1.88
% 1.67/1.88 ------------> process sos:
% 1.67/1.88 ** KEPT (pick-wt=3): 3 [] big_f(A,B).
% 1.67/1.88
% 1.67/1.88 ======= end of input processing =======
% 1.67/1.88
% 1.67/1.88 =========== start of search ===========
% 1.67/1.88
% 1.67/1.88 -------- PROOF --------
% 1.67/1.88
% 1.67/1.88 -----> EMPTY CLAUSE at 0.00 sec ----> 5 [hyper,4,2,3,3,4] $F.
% 1.67/1.88
% 1.67/1.88 Length of proof is 1. Level of proof is 1.
% 1.67/1.88
% 1.67/1.88 ---------------- PROOF ----------------
% 1.67/1.88 % SZS status Theorem
% 1.67/1.88 % SZS output start Refutation
% See solution above
% 1.67/1.88 ------------ end of proof -------------
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88 ============ end of search ============
% 1.67/1.88
% 1.67/1.88 -------------- statistics -------------
% 1.67/1.88 clauses given 2
% 1.67/1.88 clauses generated 3
% 1.67/1.88 clauses kept 4
% 1.67/1.88 clauses forward subsumed 1
% 1.67/1.88 clauses back subsumed 1
% 1.67/1.88 Kbytes malloced 976
% 1.67/1.88
% 1.67/1.88 ----------- times (seconds) -----------
% 1.67/1.88 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.88 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.88 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.67/1.88
% 1.67/1.88 That finishes the proof of the theorem.
% 1.67/1.88
% 1.67/1.88 Process 13327 finished Wed Jul 27 11:10:40 2022
% 1.67/1.88 Otter interrupted
% 1.67/1.88 PROOF FOUND
%------------------------------------------------------------------------------