TSTP Solution File: SYN554-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN554-1 : TPTP v8.1.0. Released v2.5.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:53 EDT 2022
% Result : Unsatisfiable 1.71s 1.90s
% Output : Refutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 8 unt; 3 nHn; 11 RR)
% Number of literals : 25 ( 0 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ p4(A,A),
file('SYN554-1.p',unknown),
[] ).
cnf(2,axiom,
~ p2(c6,c7),
file('SYN554-1.p',unknown),
[] ).
cnf(3,axiom,
( p2(A,B)
| ~ p2(C,B)
| ~ p2(C,A) ),
file('SYN554-1.p',unknown),
[] ).
cnf(4,axiom,
( p4(f3(c5,A),f3(c5,B))
| ~ p4(A,B) ),
file('SYN554-1.p',unknown),
[] ).
cnf(5,axiom,
( p4(A,B)
| ~ p2(C,B)
| ~ p4(D,C)
| ~ p2(D,A) ),
file('SYN554-1.p',unknown),
[] ).
cnf(9,axiom,
p2(A,A),
file('SYN554-1.p',unknown),
[] ).
cnf(10,axiom,
p2(f3(c5,c6),f3(c5,c7)),
file('SYN554-1.p',unknown),
[] ).
cnf(11,axiom,
( p2(A,B)
| p4(A,B)
| p4(B,A) ),
file('SYN554-1.p',unknown),
[] ).
cnf(15,plain,
p2(f3(c5,c7),f3(c5,c6)),
inference(hyper,[status(thm)],[10,3,9]),
[iquote('hyper,10,3,9')] ).
cnf(25,plain,
( p2(A,B)
| p4(B,A)
| p4(f3(c5,A),f3(c5,B)) ),
inference(hyper,[status(thm)],[11,4]),
[iquote('hyper,11,4')] ).
cnf(262,plain,
( p4(c7,c6)
| p4(f3(c5,c7),f3(c5,c6)) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[25,5,15,10]),2]),
[iquote('hyper,25,5,15,10,unit_del,2')] ).
cnf(335,plain,
p4(f3(c5,c7),f3(c5,c6)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[262,4])]),
[iquote('hyper,262,4,factor_simp')] ).
cnf(339,plain,
p4(f3(c5,c7),f3(c5,c7)),
inference(hyper,[status(thm)],[335,5,10,9]),
[iquote('hyper,335,5,10,9')] ).
cnf(340,plain,
$false,
inference(binary,[status(thm)],[339,1]),
[iquote('binary,339.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN554-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n007.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 10:55:31 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.71/1.90 ----- Otter 3.3f, August 2004 -----
% 1.71/1.90 The process was started by sandbox2 on n007.cluster.edu,
% 1.71/1.90 Wed Jul 27 10:55:31 2022
% 1.71/1.90 The command was "./otter". The process ID is 5685.
% 1.71/1.90
% 1.71/1.90 set(prolog_style_variables).
% 1.71/1.90 set(auto).
% 1.71/1.90 dependent: set(auto1).
% 1.71/1.90 dependent: set(process_input).
% 1.71/1.90 dependent: clear(print_kept).
% 1.71/1.90 dependent: clear(print_new_demod).
% 1.71/1.90 dependent: clear(print_back_demod).
% 1.71/1.90 dependent: clear(print_back_sub).
% 1.71/1.90 dependent: set(control_memory).
% 1.71/1.90 dependent: assign(max_mem, 12000).
% 1.71/1.90 dependent: assign(pick_given_ratio, 4).
% 1.71/1.90 dependent: assign(stats_level, 1).
% 1.71/1.90 dependent: assign(max_seconds, 10800).
% 1.71/1.90 clear(print_given).
% 1.71/1.90
% 1.71/1.90 list(usable).
% 1.71/1.90 0 [] p2(X2,X2).
% 1.71/1.90 0 [] -p4(X15,X15).
% 1.71/1.90 0 [] -p2(c6,c7).
% 1.71/1.90 0 [] p2(f3(c5,c6),f3(c5,c7)).
% 1.71/1.90 0 [] p2(X0,X1)|p4(X0,X1)|p4(X1,X0).
% 1.71/1.90 0 [] p2(X3,X4)| -p2(X2,X4)| -p2(X2,X3).
% 1.71/1.90 0 [] p4(f3(c5,X13),f3(c5,X14))| -p4(X13,X14).
% 1.71/1.90 0 [] p4(X9,X10)| -p2(X12,X10)| -p4(X11,X12)| -p2(X11,X9).
% 1.71/1.90 0 [] p2(f3(X5,X6),f3(X7,X8))| -p2(X5,X7)| -p2(X6,X8).
% 1.71/1.90 end_of_list.
% 1.71/1.90
% 1.71/1.90 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.71/1.90
% 1.71/1.90 This is a non-Horn set without equality. The strategy will
% 1.71/1.90 be ordered hyper_res, unit deletion, and factoring, with
% 1.71/1.90 satellites in sos and with nuclei in usable.
% 1.71/1.90
% 1.71/1.90 dependent: set(hyper_res).
% 1.71/1.90 dependent: set(factor).
% 1.71/1.90 dependent: set(unit_deletion).
% 1.71/1.90
% 1.71/1.90 ------------> process usable:
% 1.71/1.90 ** KEPT (pick-wt=3): 1 [] -p4(A,A).
% 1.71/1.90 ** KEPT (pick-wt=3): 2 [] -p2(c6,c7).
% 1.71/1.90 ** KEPT (pick-wt=9): 3 [] p2(A,B)| -p2(C,B)| -p2(C,A).
% 1.71/1.90 ** KEPT (pick-wt=10): 4 [] p4(f3(c5,A),f3(c5,B))| -p4(A,B).
% 1.71/1.90 ** KEPT (pick-wt=12): 5 [] p4(A,B)| -p2(C,B)| -p4(D,C)| -p2(D,A).
% 1.71/1.90 ** KEPT (pick-wt=13): 6 [] p2(f3(A,B),f3(C,D))| -p2(A,C)| -p2(B,D).
% 1.71/1.90
% 1.71/1.90 ------------> process sos:
% 1.71/1.90 ** KEPT (pick-wt=3): 9 [] p2(A,A).
% 1.71/1.90 ** KEPT (pick-wt=7): 10 [] p2(f3(c5,c6),f3(c5,c7)).
% 1.71/1.90 ** KEPT (pick-wt=9): 11 [] p2(A,B)|p4(A,B)|p4(B,A).
% 1.71/1.90 9 back subsumes 7.
% 1.71/1.90
% 1.71/1.90 ======= end of input processing =======
% 1.71/1.90
% 1.71/1.90 =========== start of search ===========
% 1.71/1.90
% 1.71/1.90 -------- PROOF --------
% 1.71/1.90
% 1.71/1.90 ----> UNIT CONFLICT at 0.01 sec ----> 340 [binary,339.1,1.1] $F.
% 1.71/1.90
% 1.71/1.90 Length of proof is 5. Level of proof is 4.
% 1.71/1.90
% 1.71/1.90 ---------------- PROOF ----------------
% 1.71/1.90 % SZS status Unsatisfiable
% 1.71/1.90 % SZS output start Refutation
% See solution above
% 1.71/1.90 ------------ end of proof -------------
% 1.71/1.90
% 1.71/1.90
% 1.71/1.90 Search stopped by max_proofs option.
% 1.71/1.90
% 1.71/1.90
% 1.71/1.90 Search stopped by max_proofs option.
% 1.71/1.90
% 1.71/1.90 ============ end of search ============
% 1.71/1.90
% 1.71/1.90 -------------- statistics -------------
% 1.71/1.90 clauses given 14
% 1.71/1.90 clauses generated 462
% 1.71/1.90 clauses kept 339
% 1.71/1.90 clauses forward subsumed 132
% 1.71/1.90 clauses back subsumed 7
% 1.71/1.90 Kbytes malloced 976
% 1.71/1.90
% 1.71/1.90 ----------- times (seconds) -----------
% 1.71/1.90 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.71/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.71/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.71/1.90
% 1.71/1.90 That finishes the proof of the theorem.
% 1.71/1.90
% 1.71/1.90 Process 5685 finished Wed Jul 27 10:55:32 2022
% 1.71/1.90 Otter interrupted
% 1.71/1.90 PROOF FOUND
%------------------------------------------------------------------------------