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