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