TSTP Solution File: SYN393+1.003 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN393+1.003 : TPTP v8.1.0. Released v2.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:24:26 EDT 2022
% Result : Theorem 1.65s 1.86s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 19 ( 4 unt; 9 nHn; 19 RR)
% Number of literals : 46 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p1
| ~ p2
| p3 ),
file('SYN393+1.003.p',unknown),
[] ).
cnf(2,axiom,
( ~ p1
| p2
| ~ p3 ),
file('SYN393+1.003.p',unknown),
[] ).
cnf(3,plain,
( ~ p1
| ~ p3
| p2 ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[2])]),
[iquote('copy,2,propositional')] ).
cnf(4,axiom,
( p1
| ~ p2
| ~ p3 ),
file('SYN393+1.003.p',unknown),
[] ).
cnf(5,plain,
( ~ p2
| ~ p3
| p1 ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[4])]),
[iquote('copy,4,propositional')] ).
cnf(6,axiom,
( ~ p1
| p2
| p3 ),
file('SYN393+1.003.p',unknown),
[] ).
cnf(7,axiom,
( p1
| ~ p2
| p3 ),
file('SYN393+1.003.p',unknown),
[] ).
cnf(8,plain,
( ~ p2
| p1
| p3 ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,propositional')] ).
cnf(9,axiom,
( p1
| p2
| ~ p3 ),
file('SYN393+1.003.p',unknown),
[] ).
cnf(10,plain,
( ~ p3
| p1
| p2 ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[9])]),
[iquote('copy,9,propositional')] ).
cnf(11,axiom,
( ~ p1
| ~ p2
| ~ p3 ),
file('SYN393+1.003.p',unknown),
[] ).
cnf(12,axiom,
( p1
| p2
| p3 ),
file('SYN393+1.003.p',unknown),
[] ).
cnf(13,plain,
( p1
| p2 ),
inference(hyper,[status(thm)],[12,10]),
[iquote('hyper,12,10')] ).
cnf(14,plain,
( p1
| p3 ),
inference(hyper,[status(thm)],[13,8]),
[iquote('hyper,13,8')] ).
cnf(15,plain,
p1,
inference(hyper,[status(thm)],[14,5,13]),
[iquote('hyper,14,5,13')] ).
cnf(16,plain,
( p2
| p3 ),
inference(hyper,[status(thm)],[15,6]),
[iquote('hyper,15,6')] ).
cnf(17,plain,
p2,
inference(hyper,[status(thm)],[16,3,15]),
[iquote('hyper,16,3,15')] ).
cnf(18,plain,
p3,
inference(hyper,[status(thm)],[17,1,15]),
[iquote('hyper,17,1,15')] ).
cnf(19,plain,
$false,
inference(hyper,[status(thm)],[18,11,15,17]),
[iquote('hyper,18,11,15,17')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN393+1.003 : TPTP v8.1.0. Released v2.0.0.
% 0.10/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:09:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.65/1.86 ----- Otter 3.3f, August 2004 -----
% 1.65/1.86 The process was started by sandbox2 on n009.cluster.edu,
% 1.65/1.86 Wed Jul 27 11:09:06 2022
% 1.65/1.86 The command was "./otter". The process ID is 11353.
% 1.65/1.86
% 1.65/1.86 set(prolog_style_variables).
% 1.65/1.86 set(auto).
% 1.65/1.86 dependent: set(auto1).
% 1.65/1.86 dependent: set(process_input).
% 1.65/1.86 dependent: clear(print_kept).
% 1.65/1.86 dependent: clear(print_new_demod).
% 1.65/1.86 dependent: clear(print_back_demod).
% 1.65/1.86 dependent: clear(print_back_sub).
% 1.65/1.86 dependent: set(control_memory).
% 1.65/1.86 dependent: assign(max_mem, 12000).
% 1.65/1.86 dependent: assign(pick_given_ratio, 4).
% 1.65/1.86 dependent: assign(stats_level, 1).
% 1.65/1.86 dependent: assign(max_seconds, 10800).
% 1.65/1.86 clear(print_given).
% 1.65/1.86
% 1.65/1.86 formula_list(usable).
% 1.65/1.86 -(((p1<->p2)<->p3)<-> (p1<-> (p2<->p3))).
% 1.65/1.86 end_of_list.
% 1.65/1.86
% 1.65/1.86 -------> usable clausifies to:
% 1.65/1.86
% 1.65/1.86 list(usable).
% 1.65/1.86 0 [] p1|p2|p3.
% 1.65/1.86 0 [] -p1| -p2|p3.
% 1.65/1.86 0 [] -p1|p2| -p3.
% 1.65/1.86 0 [] p1| -p2| -p3.
% 1.65/1.86 0 [] -p1|p2|p3.
% 1.65/1.86 0 [] p1| -p2|p3.
% 1.65/1.86 0 [] p1|p2| -p3.
% 1.65/1.86 0 [] -p1| -p2| -p3.
% 1.65/1.86 end_of_list.
% 1.65/1.86
% 1.65/1.86 SCAN INPUT: prop=1, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.65/1.86
% 1.65/1.86 The clause set is propositional; the strategy will be
% 1.65/1.86 ordered hyperresolution with the propositional
% 1.65/1.86 optimizations, with satellites in sos and nuclei in usable.
% 1.65/1.86
% 1.65/1.86 dependent: set(hyper_res).
% 1.65/1.86 dependent: set(propositional).
% 1.65/1.86 dependent: set(sort_literals).
% 1.65/1.86
% 1.65/1.86 ------------> process usable:
% 1.65/1.86 ** KEPT (pick-wt=3): 1 [] -p1| -p2|p3.
% 1.65/1.86 ** KEPT (pick-wt=3): 3 [copy,2,propositional] -p1| -p3|p2.
% 1.65/1.86 ** KEPT (pick-wt=3): 5 [copy,4,propositional] -p2| -p3|p1.
% 1.65/1.86 ** KEPT (pick-wt=3): 6 [] -p1|p2|p3.
% 1.65/1.86 ** KEPT (pick-wt=3): 8 [copy,7,propositional] -p2|p1|p3.
% 1.65/1.86 ** KEPT (pick-wt=3): 10 [copy,9,propositional] -p3|p1|p2.
% 1.65/1.86 ** KEPT (pick-wt=3): 11 [] -p1| -p2| -p3.
% 1.65/1.86
% 1.65/1.86 ------------> process sos:
% 1.65/1.86 ** KEPT (pick-wt=3): 12 [] p1|p2|p3.
% 1.65/1.86
% 1.65/1.86 ======= end of input processing =======
% 1.65/1.86
% 1.65/1.86 =========== start of search ===========
% 1.65/1.86
% 1.65/1.86 -------- PROOF --------
% 1.65/1.86
% 1.65/1.86 -----> EMPTY CLAUSE at 0.00 sec ----> 19 [hyper,18,11,15,17] $F.
% 1.65/1.86
% 1.65/1.86 Length of proof is 10. Level of proof is 7.
% 1.65/1.86
% 1.65/1.86 ---------------- PROOF ----------------
% 1.65/1.86 % SZS status Theorem
% 1.65/1.86 % SZS output start Refutation
% See solution above
% 1.65/1.86 ------------ end of proof -------------
% 1.65/1.86
% 1.65/1.86
% 1.65/1.86 Search stopped by max_proofs option.
% 1.65/1.86
% 1.65/1.86
% 1.65/1.86 Search stopped by max_proofs option.
% 1.65/1.86
% 1.65/1.86 ============ end of search ============
% 1.65/1.86
% 1.65/1.86 -------------- statistics -------------
% 1.65/1.86 clauses given 7
% 1.65/1.86 clauses generated 7
% 1.65/1.86 clauses kept 14
% 1.65/1.86 clauses forward subsumed 0
% 1.65/1.86 clauses back subsumed 10
% 1.65/1.86 Kbytes malloced 976
% 1.65/1.86
% 1.65/1.86 ----------- times (seconds) -----------
% 1.65/1.86 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.65/1.86 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.65/1.86 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.65/1.86
% 1.65/1.86 That finishes the proof of the theorem.
% 1.65/1.86
% 1.65/1.86 Process 11353 finished Wed Jul 27 11:09:07 2022
% 1.65/1.86 Otter interrupted
% 1.65/1.86 PROOF FOUND
%------------------------------------------------------------------------------