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 v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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 : Theorem 1.66s 1.88s
% Output : Refutation 1.66s
% 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(dollar_c2,f(dollar_c2))
| ~ big_f(A,dollar_c1)
| big_f(A,f(dollar_c2)) ),
file('SYN082+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big_f(dollar_c2,f(dollar_c2))
| big_f(dollar_f1(A),A)
| ~ big_f(dollar_c2,A) ),
file('SYN082+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big_f(dollar_c2,f(dollar_c2))
| ~ big_f(dollar_f1(A),f(dollar_c2))
| ~ big_f(dollar_c2,A) ),
file('SYN082+1.p',unknown),
[] ).
cnf(4,plain,
( big_f(dollar_c2,f(dollar_c2))
| ~ big_f(dollar_c2,dollar_c1) ),
inference(factor,[status(thm)],[1]),
[iquote('factor,1.1.3')] ).
cnf(5,plain,
( ~ big_f(dollar_c2,f(dollar_c2))
| big_f(dollar_f1(f(dollar_c2)),f(dollar_c2)) ),
inference(factor,[status(thm)],[2]),
[iquote('factor,2.1.3')] ).
cnf(6,plain,
( ~ big_f(dollar_c2,f(dollar_c2))
| ~ big_f(dollar_f1(f(dollar_c2)),f(dollar_c2)) ),
inference(factor,[status(thm)],[3]),
[iquote('factor,3.1.3')] ).
cnf(7,axiom,
( big_f(dollar_c2,f(dollar_c2))
| big_f(dollar_c2,dollar_c1) ),
file('SYN082+1.p',unknown),
[] ).
cnf(9,plain,
big_f(dollar_c2,f(dollar_c2)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[7,4])]),
[iquote('hyper,7,4,factor_simp')] ).
cnf(10,plain,
big_f(dollar_f1(f(dollar_c2)),f(dollar_c2)),
inference(hyper,[status(thm)],[9,5]),
[iquote('hyper,9,5')] ).
cnf(11,plain,
$false,
inference(hyper,[status(thm)],[10,6,9]),
[iquote('hyper,10,6,9')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN082+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n005.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:08:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.66/1.88 ----- Otter 3.3f, August 2004 -----
% 1.66/1.88 The process was started by sandbox on n005.cluster.edu,
% 1.66/1.88 Wed Jul 27 11:08:35 2022
% 1.66/1.88 The command was "./otter". The process ID is 19477.
% 1.66/1.88
% 1.66/1.88 set(prolog_style_variables).
% 1.66/1.88 set(auto).
% 1.66/1.88 dependent: set(auto1).
% 1.66/1.88 dependent: set(process_input).
% 1.66/1.88 dependent: clear(print_kept).
% 1.66/1.88 dependent: clear(print_new_demod).
% 1.66/1.88 dependent: clear(print_back_demod).
% 1.66/1.88 dependent: clear(print_back_sub).
% 1.66/1.88 dependent: set(control_memory).
% 1.66/1.88 dependent: assign(max_mem, 12000).
% 1.66/1.88 dependent: assign(pick_given_ratio, 4).
% 1.66/1.88 dependent: assign(stats_level, 1).
% 1.66/1.88 dependent: assign(max_seconds, 10800).
% 1.66/1.88 clear(print_given).
% 1.66/1.88
% 1.66/1.88 formula_list(usable).
% 1.66/1.88 -(all X (big_f(X,f(X))<-> (exists Y ((all Z (big_f(Z,Y)->big_f(Z,f(X))))&big_f(X,Y))))).
% 1.66/1.88 end_of_list.
% 1.66/1.88
% 1.66/1.88 -------> usable clausifies to:
% 1.66/1.88
% 1.66/1.88 list(usable).
% 1.66/1.88 0 [] big_f($c2,f($c2))| -big_f(Z,$c1)|big_f(Z,f($c2)).
% 1.66/1.88 0 [] big_f($c2,f($c2))|big_f($c2,$c1).
% 1.66/1.88 0 [] -big_f($c2,f($c2))|big_f($f1(Y),Y)| -big_f($c2,Y).
% 1.66/1.88 0 [] -big_f($c2,f($c2))| -big_f($f1(Y),f($c2))| -big_f($c2,Y).
% 1.66/1.88 end_of_list.
% 1.66/1.88
% 1.66/1.88 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.66/1.88
% 1.66/1.88 This is a non-Horn set without equality. The strategy will
% 1.66/1.88 be ordered hyper_res, unit deletion, and factoring, with
% 1.66/1.88 satellites in sos and with nuclei in usable.
% 1.66/1.88
% 1.66/1.88 dependent: set(hyper_res).
% 1.66/1.88 dependent: set(factor).
% 1.66/1.88 dependent: set(unit_deletion).
% 1.66/1.88
% 1.66/1.88 ------------> process usable:
% 1.66/1.88 ** KEPT (pick-wt=11): 1 [] big_f($c2,f($c2))| -big_f(A,$c1)|big_f(A,f($c2)).
% 1.66/1.88 ** KEPT (pick-wt=11): 2 [] -big_f($c2,f($c2))|big_f($f1(A),A)| -big_f($c2,A).
% 1.66/1.88 ** KEPT (pick-wt=12): 3 [] -big_f($c2,f($c2))| -big_f($f1(A),f($c2))| -big_f($c2,A).
% 1.66/1.88
% 1.66/1.88 ------------> process sos:
% 1.66/1.88 ** KEPT (pick-wt=7): 7 [] big_f($c2,f($c2))|big_f($c2,$c1).
% 1.66/1.88
% 1.66/1.88 ======= end of input processing =======
% 1.66/1.88
% 1.66/1.88 =========== start of search ===========
% 1.66/1.88
% 1.66/1.88 -------- PROOF --------
% 1.66/1.88
% 1.66/1.88 -----> EMPTY CLAUSE at 0.00 sec ----> 11 [hyper,10,6,9] $F.
% 1.66/1.88
% 1.66/1.88 Length of proof is 5. Level of proof is 3.
% 1.66/1.88
% 1.66/1.88 ---------------- PROOF ----------------
% 1.66/1.88 % SZS status Theorem
% 1.66/1.88 % SZS output start Refutation
% See solution above
% 1.66/1.88 ------------ end of proof -------------
% 1.66/1.88
% 1.66/1.88
% 1.66/1.88 Search stopped by max_proofs option.
% 1.66/1.88
% 1.66/1.88
% 1.66/1.88 Search stopped by max_proofs option.
% 1.66/1.88
% 1.66/1.88 ============ end of search ============
% 1.66/1.88
% 1.66/1.88 -------------- statistics -------------
% 1.66/1.88 clauses given 3
% 1.66/1.88 clauses generated 14
% 1.66/1.88 clauses kept 10
% 1.66/1.88 clauses forward subsumed 7
% 1.66/1.88 clauses back subsumed 5
% 1.66/1.88 Kbytes malloced 976
% 1.66/1.88
% 1.66/1.88 ----------- times (seconds) -----------
% 1.66/1.88 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.88 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.88 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.66/1.88
% 1.66/1.88 That finishes the proof of the theorem.
% 1.66/1.88
% 1.66/1.88 Process 19477 finished Wed Jul 27 11:08:37 2022
% 1.66/1.88 Otter interrupted
% 1.66/1.88 PROOF FOUND
%------------------------------------------------------------------------------