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