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