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