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