TSTP Solution File: SYN343+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN343+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:18 EDT 2022
% Result : Theorem 1.67s 1.89s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of clauses : 5 ( 3 unt; 1 nHn; 3 RR)
% Number of literals : 7 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 8 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ big_f(A,A)
| ~ big_f(B,C) ),
file('SYN343+1.p',unknown),
[] ).
cnf(3,plain,
~ big_f(A,A),
inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[2])]),
[iquote('copy,2,factor_simp')] ).
cnf(4,axiom,
( big_f(A,B)
| big_f(A,A) ),
file('SYN343+1.p',unknown),
[] ).
cnf(5,plain,
big_f(A,B),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[4]),3]),
[iquote('copy,4,unit_del,3')] ).
cnf(6,plain,
$false,
inference(binary,[status(thm)],[5,3]),
[iquote('binary,5.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN343+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 10:55:46 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.67/1.89
% 1.67/1.89 -------- PROOF --------
% 1.67/1.89 ----- Otter 3.3f, August 2004 -----
% 1.67/1.89 The process was started by sandbox on n007.cluster.edu,
% 1.67/1.89 Wed Jul 27 10:55:46 2022
% 1.67/1.89 The command was "./otter". The process ID is 6996.
% 1.67/1.89
% 1.67/1.89 set(prolog_style_variables).
% 1.67/1.89 set(auto).
% 1.67/1.89 dependent: set(auto1).
% 1.67/1.89 dependent: set(process_input).
% 1.67/1.89 dependent: clear(print_kept).
% 1.67/1.89 dependent: clear(print_new_demod).
% 1.67/1.89 dependent: clear(print_back_demod).
% 1.67/1.89 dependent: clear(print_back_sub).
% 1.67/1.89 dependent: set(control_memory).
% 1.67/1.89 dependent: assign(max_mem, 12000).
% 1.67/1.89 dependent: assign(pick_given_ratio, 4).
% 1.67/1.89 dependent: assign(stats_level, 1).
% 1.67/1.89 dependent: assign(max_seconds, 10800).
% 1.67/1.89 clear(print_given).
% 1.67/1.89
% 1.67/1.89 formula_list(usable).
% 1.67/1.89 -(exists X Y1 Y2 all Z (((big_f(X,Y1)->big_f(Z,X))->big_f(X,X))->big_f(X,X)&big_f(Y1,Y2))).
% 1.67/1.89 end_of_list.
% 1.67/1.89
% 1.67/1.89 -------> usable clausifies to:
% 1.67/1.89
% 1.67/1.89 list(usable).
% 1.67/1.89 0 [] big_f(X,Y1)|big_f(X,X).
% 1.67/1.89 0 [] -big_f($f1(X,Y1,Y2),X)|big_f(X,X).
% 1.67/1.89 0 [] -big_f(X,X)| -big_f(Y1,Y2).
% 1.67/1.89 end_of_list.
% 1.67/1.89
% 1.67/1.89 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.67/1.89
% 1.67/1.89 This is a non-Horn set without equality. The strategy will
% 1.67/1.89 be ordered hyper_res, unit deletion, and factoring, with
% 1.67/1.89 satellites in sos and with nuclei in usable.
% 1.67/1.89
% 1.67/1.89 dependent: set(hyper_res).
% 1.67/1.89 dependent: set(factor).
% 1.67/1.89 dependent: set(unit_deletion).
% 1.67/1.89
% 1.67/1.89 ------------> process usable:
% 1.67/1.89 ** KEPT (pick-wt=9): 1 [] -big_f($f1(A,B,C),A)|big_f(A,A).
% 1.67/1.89 ** KEPT (pick-wt=3): 3 [copy,2,factor_simp] -big_f(A,A).
% 1.67/1.89
% 1.67/1.89 ------------> process sos:
% 1.67/1.89 ** KEPT (pick-wt=3): 5 [copy,4,unit_del,3] big_f(A,B).
% 1.67/1.89
% 1.67/1.89 ----> UNIT CONFLICT at 0.00 sec ----> 6 [binary,5.1,3.1] $F.
% 1.67/1.89
% 1.67/1.89 Length of proof is 2. Level of proof is 2.
% 1.67/1.89
% 1.67/1.89 ---------------- PROOF ----------------
% 1.67/1.89 % SZS status Theorem
% 1.67/1.89 % SZS output start Refutation
% See solution above
% 1.67/1.89 ------------ end of proof -------------
% 1.67/1.89
% 1.67/1.89
% 1.67/1.89 Search stopped by max_proofs option.
% 1.67/1.89
% 1.67/1.89
% 1.67/1.89 Search stopped by max_proofs option.
% 1.67/1.89
% 1.67/1.89 ============ end of search ============
% 1.67/1.89
% 1.67/1.89 -------------- statistics -------------
% 1.67/1.89 clauses given 0
% 1.67/1.89 clauses generated 0
% 1.67/1.89 clauses kept 3
% 1.67/1.89 clauses forward subsumed 0
% 1.67/1.89 clauses back subsumed 0
% 1.67/1.89 Kbytes malloced 976
% 1.67/1.89
% 1.67/1.89 ----------- times (seconds) -----------
% 1.67/1.89 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.89 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.67/1.89
% 1.67/1.89 That finishes the proof of the theorem.
% 1.67/1.89
% 1.67/1.89 Process 6996 finished Wed Jul 27 10:55:47 2022
% 1.67/1.89 Otter interrupted
% 1.67/1.89 PROOF FOUND
%------------------------------------------------------------------------------