TSTP Solution File: SWV005-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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 3.26s 3.45s
% Output : Refutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 12 ( 8 unt; 3 nHn; 10 RR)
% Number of literals : 21 ( 3 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
~ less_than(A,A),
file('SWV005-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ less_than(A,B)
| ~ less_than(B,A) ),
file('SWV005-1.p',unknown),
[] ).
cnf(8,axiom,
~ less_than(n,k),
file('SWV005-1.p',unknown),
[] ).
cnf(9,axiom,
~ less_than(k,l),
file('SWV005-1.p',unknown),
[] ).
cnf(12,axiom,
( less_than(A,l)
| less_than(n,A)
| ~ less_than(one,l)
| ~ less_than(a(A),a(predecessor(l))) ),
file('SWV005-1.p',unknown),
[] ).
cnf(21,axiom,
( less_than(A,B)
| less_than(B,A)
| A = B ),
file('SWV005-1.p',unknown),
[] ).
cnf(23,axiom,
less_than(one,l),
file('SWV005-1.p',unknown),
[] ).
cnf(24,axiom,
less_than(a(k),a(predecessor(l))),
file('SWV005-1.p',unknown),
[] ).
cnf(125,plain,
( less_than(a(predecessor(l)),a(A))
| a(A) = a(predecessor(l))
| less_than(A,l)
| less_than(n,A) ),
inference(hyper,[status(thm)],[21,12,23]),
[iquote('hyper,21,12,23')] ).
cnf(5703,plain,
a(predecessor(l)) = a(k),
inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[125,5,24]),9,8])]),
[iquote('hyper,125,5,24,unit_del,9,8,flip.1')] ).
cnf(5718,plain,
less_than(a(k),a(k)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[24]),5703]),
[iquote('back_demod,24,demod,5703')] ).
cnf(5719,plain,
$false,
inference(binary,[status(thm)],[5718,4]),
[iquote('binary,5718.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n013.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:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.87/3.10 ----- Otter 3.3f, August 2004 -----
% 2.87/3.10 The process was started by sandbox on n013.cluster.edu,
% 2.87/3.10 Wed Jul 27 06:21:15 2022
% 2.87/3.10 The command was "./otter". The process ID is 24344.
% 2.87/3.10
% 2.87/3.10 set(prolog_style_variables).
% 2.87/3.10 set(auto).
% 2.87/3.10 dependent: set(auto1).
% 2.87/3.10 dependent: set(process_input).
% 2.87/3.10 dependent: clear(print_kept).
% 2.87/3.10 dependent: clear(print_new_demod).
% 2.87/3.10 dependent: clear(print_back_demod).
% 2.87/3.10 dependent: clear(print_back_sub).
% 2.87/3.10 dependent: set(control_memory).
% 2.87/3.10 dependent: assign(max_mem, 12000).
% 2.87/3.10 dependent: assign(pick_given_ratio, 4).
% 2.87/3.10 dependent: assign(stats_level, 1).
% 2.87/3.10 dependent: assign(max_seconds, 10800).
% 2.87/3.10 clear(print_given).
% 2.87/3.10
% 2.87/3.10 list(usable).
% 2.87/3.10 0 [] A=A.
% 2.87/3.10 0 [] predecessor(successor(X))=X.
% 2.87/3.10 0 [] successor(predecessor(X))=X.
% 2.87/3.10 0 [] X=Y|predecessor(X)!=predecessor(Y).
% 2.87/3.10 0 [] X=Y|successor(X)!=successor(Y).
% 2.87/3.10 0 [] less_than(predecessor(X),X).
% 2.87/3.10 0 [] less_than(X,successor(X)).
% 2.87/3.10 0 [] less_than(X,Z)| -less_than(X,Y)| -less_than(Y,Z).
% 2.87/3.10 0 [] less_than(X,Y)|less_than(Y,X)|X=Y.
% 2.87/3.10 0 [] -less_than(X,X).
% 2.87/3.10 0 [] -less_than(X,Y)| -less_than(Y,X).
% 2.87/3.10 0 [] less_than(Y,Z)|X!=Y| -less_than(X,Z).
% 2.87/3.10 0 [] less_than(Z,Y)|X!=Y| -less_than(Z,X).
% 2.87/3.10 0 [] -less_than(n,k).
% 2.87/3.10 0 [] -less_than(k,l).
% 2.87/3.10 0 [] -less_than(k,i).
% 2.87/3.10 0 [] less_than(l,n).
% 2.87/3.10 0 [] less_than(one,l).
% 2.87/3.10 0 [] less_than(a(k),a(predecessor(l))).
% 2.87/3.10 0 [] less_than(X,l)| -less_than(X,successor(n))| -less_than(a(X),a(k)).
% 2.87/3.10 0 [] less_than(X,l)|less_than(n,X)| -less_than(one,l)| -less_than(a(X),a(predecessor(l))).
% 2.87/3.10 0 [] -less_than(one,X)| -less_than(X,l)| -less_than(a(X),a(predecessor(X))).
% 2.87/3.10 end_of_list.
% 2.87/3.10
% 2.87/3.10 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 2.87/3.10
% 2.87/3.10 This ia a non-Horn set with equality. The strategy will be
% 2.87/3.10 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.87/3.10 deletion, with positive clauses in sos and nonpositive
% 2.87/3.10 clauses in usable.
% 2.87/3.10
% 2.87/3.10 dependent: set(knuth_bendix).
% 2.87/3.10 dependent: set(anl_eq).
% 2.87/3.10 dependent: set(para_from).
% 2.87/3.10 dependent: set(para_into).
% 2.87/3.10 dependent: clear(para_from_right).
% 2.87/3.10 dependent: clear(para_into_right).
% 2.87/3.10 dependent: set(para_from_vars).
% 2.87/3.10 dependent: set(eq_units_both_ways).
% 2.87/3.10 dependent: set(dynamic_demod_all).
% 2.87/3.10 dependent: set(dynamic_demod).
% 2.87/3.10 dependent: set(order_eq).
% 2.87/3.10 dependent: set(back_demod).
% 2.87/3.10 dependent: set(lrpo).
% 2.87/3.10 dependent: set(hyper_res).
% 2.87/3.10 dependent: set(unit_deletion).
% 2.87/3.10 dependent: set(factor).
% 2.87/3.10
% 2.87/3.10 ------------> process usable:
% 2.87/3.10 ** KEPT (pick-wt=8): 1 [] A=B|predecessor(A)!=predecessor(B).
% 2.87/3.10 ** KEPT (pick-wt=8): 2 [] A=B|successor(A)!=successor(B).
% 2.87/3.10 ** KEPT (pick-wt=9): 3 [] less_than(A,B)| -less_than(A,C)| -less_than(C,B).
% 2.87/3.10 ** KEPT (pick-wt=3): 4 [] -less_than(A,A).
% 2.87/3.10 ** KEPT (pick-wt=6): 5 [] -less_than(A,B)| -less_than(B,A).
% 2.87/3.10 ** KEPT (pick-wt=9): 6 [] less_than(A,B)|C!=A| -less_than(C,B).
% 2.87/3.10 ** KEPT (pick-wt=9): 7 [] less_than(A,B)|C!=B| -less_than(A,C).
% 2.87/3.10 ** KEPT (pick-wt=3): 8 [] -less_than(n,k).
% 2.87/3.10 ** KEPT (pick-wt=3): 9 [] -less_than(k,l).
% 2.87/3.10 ** KEPT (pick-wt=3): 10 [] -less_than(k,i).
% 2.87/3.10 ** KEPT (pick-wt=12): 11 [] less_than(A,l)| -less_than(A,successor(n))| -less_than(a(A),a(k)).
% 2.87/3.10 ** KEPT (pick-wt=15): 12 [] less_than(A,l)|less_than(n,A)| -less_than(one,l)| -less_than(a(A),a(predecessor(l))).
% 2.87/3.10 ** KEPT (pick-wt=12): 13 [] -less_than(one,A)| -less_than(A,l)| -less_than(a(A),a(predecessor(A))).
% 2.87/3.10
% 2.87/3.10 ------------> process sos:
% 2.87/3.10 ** KEPT (pick-wt=3): 14 [] A=A.
% 2.87/3.10 ** KEPT (pick-wt=5): 15 [] predecessor(successor(A))=A.
% 2.87/3.10 ---> New Demodulator: 16 [new_demod,15] predecessor(successor(A))=A.
% 2.87/3.10 ** KEPT (pick-wt=5): 17 [] successor(predecessor(A))=A.
% 2.87/3.10 ---> New Demodulator: 18 [new_demod,17] successor(predecessor(A))=A.
% 2.87/3.10 ** KEPT (pick-wt=4): 19 [] less_than(predecessor(A),A).
% 2.87/3.10 ** KEPT (pick-wt=4): 20 [] less_than(A,successor(A)).
% 2.87/3.10 ** KEPT (pick-wt=9): 21 [] less_than(A,B)|less_than(B,A)|A=B.
% 2.87/3.10 ** KEPT (pick-wt=3): 22 [] less_than(l,n).
% 2.87/3.10 ** KEPT (pick-wt=3): 23 [] less_than(one,l).
% 2.87/3.10 ** KEPT (pick-wt=6): 24 [] less_than(a(k),a(predecessor(l))).
% 2.87/3.10 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] A=A.
% 2.87/3.10 >>>> Starting back demodulation with 16.
% 2.87/3.10 >>>> Starting back demodulation with 18.
% 2.87/3.10
% 2.87/3.10 ======= end of input processing =======
% 2.87/3.10
% 2.87/3.10 =========== start of search ===========
% 2.87/3.10
% 2.87/3.10
% 2.87/3.10 Resetting weight limit to 9.
% 3.26/3.45
% 3.26/3.45
% 3.26/3.45 Resetting weight limit to 9.
% 3.26/3.45
% 3.26/3.45 sos_size=5026
% 3.26/3.45
% 3.26/3.45 -------- PROOF --------
% 3.26/3.45
% 3.26/3.45 ----> UNIT CONFLICT at 1.38 sec ----> 5719 [binary,5718.1,4.1] $F.
% 3.26/3.45
% 3.26/3.45 Length of proof is 3. Level of proof is 3.
% 3.26/3.45
% 3.26/3.45 ---------------- PROOF ----------------
% 3.26/3.45 % SZS status Unsatisfiable
% 3.26/3.45 % SZS output start Refutation
% See solution above
% 3.26/3.45 ------------ end of proof -------------
% 3.26/3.45
% 3.26/3.45
% 3.26/3.45 Search stopped by max_proofs option.
% 3.26/3.45
% 3.26/3.45
% 3.26/3.45 Search stopped by max_proofs option.
% 3.26/3.45
% 3.26/3.45 ============ end of search ============
% 3.26/3.45
% 3.26/3.45 -------------- statistics -------------
% 3.26/3.45 clauses given 326
% 3.26/3.45 clauses generated 21227
% 3.26/3.45 clauses kept 5715
% 3.26/3.45 clauses forward subsumed 4953
% 3.26/3.45 clauses back subsumed 408
% 3.26/3.45 Kbytes malloced 4882
% 3.26/3.45
% 3.26/3.45 ----------- times (seconds) -----------
% 3.26/3.45 user CPU time 1.38 (0 hr, 0 min, 1 sec)
% 3.26/3.45 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 3.26/3.45 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.26/3.45
% 3.26/3.45 That finishes the proof of the theorem.
% 3.26/3.45
% 3.26/3.45 Process 24344 finished Wed Jul 27 06:21:18 2022
% 3.26/3.45 Otter interrupted
% 3.26/3.45 PROOF FOUND
%------------------------------------------------------------------------------