TSTP Solution File: SWV009-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV009-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:19:40 EDT 2022
% Result : Unsatisfiable 1.76s 1.94s
% Output : Refutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of clauses : 12 ( 8 unt; 1 nHn; 11 RR)
% Number of literals : 23 ( 0 equ; 11 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ less_or_e_qual(m,A)
| ~ less(A,i)
| ~ less(j,B)
| ~ less_or_e_qual(B,n)
| less_or_e_qual(a(A),a(B)) ),
file('SWV009-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ less_or_e_qual(m,A)
| ~ less_or_e_qual(A,B)
| ~ less_or_e_qual(B,j)
| less_or_e_qual(a(A),a(B)) ),
file('SWV009-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ less_or_e_qual(i,A)
| ~ less_or_e_qual(A,B)
| ~ less_or_e_qual(B,n)
| less_or_e_qual(a(A),a(B)) ),
file('SWV009-1.p',unknown),
[] ).
cnf(4,axiom,
~ less_or_e_qual(a(p),a(q)),
file('SWV009-1.p',unknown),
[] ).
cnf(13,axiom,
( less_or_e_qual(A,B)
| less(B,A) ),
file('SWV009-1.p',unknown),
[] ).
cnf(15,axiom,
less_or_e_qual(m,p),
file('SWV009-1.p',unknown),
[] ).
cnf(16,axiom,
less_or_e_qual(p,q),
file('SWV009-1.p',unknown),
[] ).
cnf(17,axiom,
less_or_e_qual(q,n),
file('SWV009-1.p',unknown),
[] ).
cnf(32,plain,
less(j,q),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[16,2,15,13]),4]),
[iquote('hyper,16,2,15,13,unit_del,4')] ).
cnf(33,plain,
less(p,i),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[17,3,13,16]),4]),
[iquote('hyper,17,3,13,16,unit_del,4')] ).
cnf(40,plain,
less_or_e_qual(a(p),a(q)),
inference(hyper,[status(thm)],[33,1,15,32,17]),
[iquote('hyper,33,1,15,32,17')] ).
cnf(41,plain,
$false,
inference(binary,[status(thm)],[40,4]),
[iquote('binary,40.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 06:21:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.76/1.94 ----- Otter 3.3f, August 2004 -----
% 1.76/1.94 The process was started by sandbox on n024.cluster.edu,
% 1.76/1.94 Wed Jul 27 06:21:25 2022
% 1.76/1.94 The command was "./otter". The process ID is 16831.
% 1.76/1.94
% 1.76/1.94 set(prolog_style_variables).
% 1.76/1.94 set(auto).
% 1.76/1.94 dependent: set(auto1).
% 1.76/1.94 dependent: set(process_input).
% 1.76/1.94 dependent: clear(print_kept).
% 1.76/1.94 dependent: clear(print_new_demod).
% 1.76/1.94 dependent: clear(print_back_demod).
% 1.76/1.94 dependent: clear(print_back_sub).
% 1.76/1.94 dependent: set(control_memory).
% 1.76/1.94 dependent: assign(max_mem, 12000).
% 1.76/1.94 dependent: assign(pick_given_ratio, 4).
% 1.76/1.94 dependent: assign(stats_level, 1).
% 1.76/1.94 dependent: assign(max_seconds, 10800).
% 1.76/1.94 clear(print_given).
% 1.76/1.94
% 1.76/1.94 list(usable).
% 1.76/1.94 0 [] less_or_e_qual(X,Y)|less(Y,X).
% 1.76/1.94 0 [] less(j,i).
% 1.76/1.94 0 [] less_or_e_qual(m,p).
% 1.76/1.94 0 [] less_or_e_qual(p,q).
% 1.76/1.94 0 [] less_or_e_qual(q,n).
% 1.76/1.94 0 [] -less_or_e_qual(m,X)| -less(X,i)| -less(j,Y)| -less_or_e_qual(Y,n)|less_or_e_qual(a(X),a(Y)).
% 1.76/1.94 0 [] -less_or_e_qual(m,X)| -less_or_e_qual(X,Y)| -less_or_e_qual(Y,j)|less_or_e_qual(a(X),a(Y)).
% 1.76/1.94 0 [] -less_or_e_qual(i,X)| -less_or_e_qual(X,Y)| -less_or_e_qual(Y,n)|less_or_e_qual(a(X),a(Y)).
% 1.76/1.94 0 [] -less_or_e_qual(a(p),a(q)).
% 1.76/1.94 end_of_list.
% 1.76/1.94
% 1.76/1.94 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.76/1.94
% 1.76/1.94 This is a non-Horn set without equality. The strategy will
% 1.76/1.94 be ordered hyper_res, unit deletion, and factoring, with
% 1.76/1.94 satellites in sos and with nuclei in usable.
% 1.76/1.94
% 1.76/1.94 dependent: set(hyper_res).
% 1.76/1.94 dependent: set(factor).
% 1.76/1.94 dependent: set(unit_deletion).
% 1.76/1.94
% 1.76/1.94 ------------> process usable:
% 1.76/1.94 ** KEPT (pick-wt=17): 1 [] -less_or_e_qual(m,A)| -less(A,i)| -less(j,B)| -less_or_e_qual(B,n)|less_or_e_qual(a(A),a(B)).
% 1.76/1.94 ** KEPT (pick-wt=14): 2 [] -less_or_e_qual(m,A)| -less_or_e_qual(A,B)| -less_or_e_qual(B,j)|less_or_e_qual(a(A),a(B)).
% 1.76/1.94 ** KEPT (pick-wt=14): 3 [] -less_or_e_qual(i,A)| -less_or_e_qual(A,B)| -less_or_e_qual(B,n)|less_or_e_qual(a(A),a(B)).
% 1.76/1.94 ** KEPT (pick-wt=5): 4 [] -less_or_e_qual(a(p),a(q)).
% 1.76/1.94
% 1.76/1.94 ------------> process sos:
% 1.76/1.94 ** KEPT (pick-wt=6): 13 [] less_or_e_qual(A,B)|less(B,A).
% 1.76/1.94 ** KEPT (pick-wt=3): 14 [] less(j,i).
% 1.76/1.94 ** KEPT (pick-wt=3): 15 [] less_or_e_qual(m,p).
% 1.76/1.94 ** KEPT (pick-wt=3): 16 [] less_or_e_qual(p,q).
% 1.76/1.94 ** KEPT (pick-wt=3): 17 [] less_or_e_qual(q,n).
% 1.76/1.94
% 1.76/1.94 ======= end of input processing =======
% 1.76/1.94
% 1.76/1.94 =========== start of search ===========
% 1.76/1.94
% 1.76/1.94 -------- PROOF --------
% 1.76/1.94
% 1.76/1.94 ----> UNIT CONFLICT at 0.00 sec ----> 41 [binary,40.1,4.1] $F.
% 1.76/1.94
% 1.76/1.94 Length of proof is 3. Level of proof is 2.
% 1.76/1.94
% 1.76/1.94 ---------------- PROOF ----------------
% 1.76/1.94 % SZS status Unsatisfiable
% 1.76/1.94 % SZS output start Refutation
% See solution above
% 1.76/1.94 ------------ end of proof -------------
% 1.76/1.94
% 1.76/1.94
% 1.76/1.94 Search stopped by max_proofs option.
% 1.76/1.94
% 1.76/1.94
% 1.76/1.94 Search stopped by max_proofs option.
% 1.76/1.94
% 1.76/1.94 ============ end of search ============
% 1.76/1.94
% 1.76/1.94 -------------- statistics -------------
% 1.76/1.94 clauses given 8
% 1.76/1.94 clauses generated 51
% 1.76/1.94 clauses kept 40
% 1.76/1.94 clauses forward subsumed 20
% 1.76/1.94 clauses back subsumed 1
% 1.76/1.94 Kbytes malloced 976
% 1.76/1.94
% 1.76/1.94 ----------- times (seconds) -----------
% 1.76/1.94 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.76/1.94 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.76/1.94 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.76/1.94
% 1.76/1.94 That finishes the proof of the theorem.
% 1.76/1.94
% 1.76/1.94 Process 16831 finished Wed Jul 27 06:21:26 2022
% 1.76/1.94 Otter interrupted
% 1.76/1.94 PROOF FOUND
%------------------------------------------------------------------------------