TSTP Solution File: SYN028-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN028-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:19 EDT 2022
% Result : Unsatisfiable 1.24s 1.77s
% Output : Refutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 3 unt; 4 nHn; 12 RR)
% Number of literals : 23 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 6 ( 5 usr; 6 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ q
| r ),
file('SYN028-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ r
| s ),
file('SYN028-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ s
| ~ r
| t ),
file('SYN028-1.p',unknown),
[] ).
cnf(4,plain,
( ~ r
| ~ s
| t ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[3])]),
[iquote('copy,3,propositional')] ).
cnf(5,axiom,
( ~ t
| p ),
file('SYN028-1.p',unknown),
[] ).
cnf(6,axiom,
~ p,
file('SYN028-1.p',unknown),
[] ).
cnf(7,axiom,
( q
| p ),
file('SYN028-1.p',unknown),
[] ).
cnf(8,plain,
( p
| r ),
inference(hyper,[status(thm)],[7,1]),
[iquote('hyper,7,1')] ).
cnf(9,plain,
( p
| s ),
inference(hyper,[status(thm)],[8,2]),
[iquote('hyper,8,2')] ).
cnf(10,plain,
( p
| t ),
inference(hyper,[status(thm)],[9,4,8]),
[iquote('hyper,9,4,8')] ).
cnf(11,plain,
p,
inference(hyper,[status(thm)],[10,5]),
[iquote('hyper,10,5')] ).
cnf(12,plain,
$false,
inference(binary,[status(thm)],[11,6]),
[iquote('binary,11.1,6.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN028-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n018.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 11:24:01 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.24/1.77 ----- Otter 3.3f, August 2004 -----
% 1.24/1.77 The process was started by sandbox on n018.cluster.edu,
% 1.24/1.77 Wed Jul 27 11:24:01 2022
% 1.24/1.77 The command was "./otter". The process ID is 4792.
% 1.24/1.77
% 1.24/1.77 set(prolog_style_variables).
% 1.24/1.77 set(auto).
% 1.24/1.77 dependent: set(auto1).
% 1.24/1.77 dependent: set(process_input).
% 1.24/1.77 dependent: clear(print_kept).
% 1.24/1.77 dependent: clear(print_new_demod).
% 1.24/1.77 dependent: clear(print_back_demod).
% 1.24/1.77 dependent: clear(print_back_sub).
% 1.24/1.77 dependent: set(control_memory).
% 1.24/1.77 dependent: assign(max_mem, 12000).
% 1.24/1.77 dependent: assign(pick_given_ratio, 4).
% 1.24/1.77 dependent: assign(stats_level, 1).
% 1.24/1.77 dependent: assign(max_seconds, 10800).
% 1.24/1.77 clear(print_given).
% 1.24/1.77
% 1.24/1.77 list(usable).
% 1.24/1.77 0 [] q|p.
% 1.24/1.77 0 [] -q|r.
% 1.24/1.77 0 [] -r|s.
% 1.24/1.77 0 [] -s| -r|t.
% 1.24/1.77 0 [] -t|p.
% 1.24/1.77 0 [] -p.
% 1.24/1.77 end_of_list.
% 1.24/1.77
% 1.24/1.77 SCAN INPUT: prop=1, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.24/1.77
% 1.24/1.77 The clause set is propositional; the strategy will be
% 1.24/1.77 ordered hyperresolution with the propositional
% 1.24/1.77 optimizations, with satellites in sos and nuclei in usable.
% 1.24/1.77
% 1.24/1.77 dependent: set(hyper_res).
% 1.24/1.77 dependent: set(propositional).
% 1.24/1.77 dependent: set(sort_literals).
% 1.24/1.77
% 1.24/1.77 ------------> process usable:
% 1.24/1.77 ** KEPT (pick-wt=2): 1 [] -q|r.
% 1.24/1.77 ** KEPT (pick-wt=2): 2 [] -r|s.
% 1.24/1.77 ** KEPT (pick-wt=3): 4 [copy,3,propositional] -r| -s|t.
% 1.24/1.77 ** KEPT (pick-wt=2): 5 [] -t|p.
% 1.24/1.77 ** KEPT (pick-wt=1): 6 [] -p.
% 1.24/1.77
% 1.24/1.77 ------------> process sos:
% 1.24/1.77 ** KEPT (pick-wt=2): 7 [] q|p.
% 1.24/1.77
% 1.24/1.77 ======= end of input processing =======
% 1.24/1.77
% 1.24/1.77 =========== start of search ===========
% 1.24/1.77
% 1.24/1.77 -------- PROOF --------
% 1.24/1.77
% 1.24/1.77 ----> UNIT CONFLICT at 0.00 sec ----> 12 [binary,11.1,6.1] $F.
% 1.24/1.77
% 1.24/1.77 Length of proof is 5. Level of proof is 4.
% 1.24/1.77
% 1.24/1.77 ---------------- PROOF ----------------
% 1.24/1.77 % SZS status Unsatisfiable
% 1.24/1.77 % SZS output start Refutation
% See solution above
% 1.24/1.77 ------------ end of proof -------------
% 1.24/1.77
% 1.24/1.77
% 1.24/1.77 Search stopped by max_proofs option.
% 1.24/1.77
% 1.24/1.77
% 1.24/1.77 Search stopped by max_proofs option.
% 1.24/1.77
% 1.24/1.77 ============ end of search ============
% 1.24/1.77
% 1.24/1.77 -------------- statistics -------------
% 1.24/1.77 clauses given 4
% 1.24/1.77 clauses generated 4
% 1.24/1.77 clauses kept 10
% 1.24/1.77 clauses forward subsumed 0
% 1.24/1.77 clauses back subsumed 0
% 1.24/1.77 Kbytes malloced 976
% 1.24/1.77
% 1.24/1.77 ----------- times (seconds) -----------
% 1.24/1.77 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.24/1.77 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.24/1.77 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.24/1.77
% 1.24/1.77 That finishes the proof of the theorem.
% 1.24/1.77
% 1.24/1.77 Process 4792 finished Wed Jul 27 11:24:03 2022
% 1.24/1.77 Otter interrupted
% 1.24/1.77 PROOF FOUND
%------------------------------------------------------------------------------