%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV008-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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.67s 1.84s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of clauses : 10 ( 6 unt; 2 nHn; 9 RR)
% Number of literals : 18 ( 2 equ; 9 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 : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
~ less_than(A,A),
file('SWV008-1.p',unknown),
[] ).
cnf(8,axiom,
~ less_than(n,l),
file('SWV008-1.p',unknown),
[] ).
cnf(9,axiom,
( less_than(A,n)
| less_than(n,A)
| ~ less_than(one,n)
| ~ less_than(a(A),a(predecessor(n))) ),
file('SWV008-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ less_than(one,A)
| ~ less_than(A,n)
| ~ less_than(a(A),a(predecessor(A))) ),
file('SWV008-1.p',unknown),
[] ).
cnf(11,plain,
( ~ less_than(one,n)
| ~ less_than(a(n),a(predecessor(n))) ),
inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[9]),4]),
[iquote('factor,9.1.2,unit_del,4')] ).
cnf(19,axiom,
( less_than(A,B)
| less_than(B,A)
| A = B ),
file('SWV008-1.p',unknown),
[] ).
cnf(20,axiom,
less_than(one,l),
file('SWV008-1.p',unknown),
[] ).
cnf(21,axiom,
less_than(a(l),a(predecessor(l))),
file('SWV008-1.p',unknown),
[] ).
cnf(233,plain,
n = l,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[21,10,20,19]),8]),
[iquote('hyper,21,10,20,19,unit_del,8')] ).
cnf(276,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[11]),233,233,233]),20,21]),
[iquote('back_demod,11,demod,233,233,233,unit_del,20,21')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV008-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.14/0.33 % Computer : n021.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Wed Jul 27 05:40:38 EDT 2022
% 0.14/0.33 % CPUTime :
% 1.67/1.84 ----- Otter 3.3f, August 2004 -----
% 1.67/1.84 The process was started by sandbox2 on n021.cluster.edu,
% 1.67/1.84 Wed Jul 27 05:40:38 2022
% 1.67/1.84 The command was "./otter". The process ID is 31273.
% 1.67/1.84
% 1.67/1.84 set(prolog_style_variables).
% 1.67/1.84 set(auto).
% 1.67/1.84 dependent: set(auto1).
% 1.67/1.84 dependent: set(process_input).
% 1.67/1.84 dependent: clear(print_kept).
% 1.67/1.84 dependent: clear(print_new_demod).
% 1.67/1.84 dependent: clear(print_back_demod).
% 1.67/1.84 dependent: clear(print_back_sub).
% 1.67/1.84 dependent: set(control_memory).
% 1.67/1.84 dependent: assign(max_mem, 12000).
% 1.67/1.84 dependent: assign(pick_given_ratio, 4).
% 1.67/1.84 dependent: assign(stats_level, 1).
% 1.67/1.84 dependent: assign(max_seconds, 10800).
% 1.67/1.84 clear(print_given).
% 1.67/1.84
% 1.67/1.84 list(usable).
% 1.67/1.84 0 [] A=A.
% 1.67/1.84 0 [] predecessor(successor(X))=X.
% 1.67/1.84 0 [] successor(predecessor(X))=X.
% 1.67/1.84 0 [] X=Y|predecessor(X)!=predecessor(Y).
% 1.67/1.84 0 [] X=Y|successor(X)!=successor(Y).
% 1.67/1.84 0 [] less_than(predecessor(X),X).
% 1.67/1.84 0 [] less_than(X,successor(X)).
% 1.67/1.84 0 [] less_than(X,Z)| -less_than(X,Y)| -less_than(Y,Z).
% 1.67/1.84 0 [] less_than(X,Y)|less_than(Y,X)|X=Y.
% 1.67/1.84 0 [] -less_than(X,X).
% 1.67/1.84 0 [] -less_than(X,Y)| -less_than(Y,X).
% 1.67/1.84 0 [] less_than(Y,Z)|X!=Y| -less_than(X,Z).
% 1.67/1.84 0 [] less_than(Z,Y)|X!=Y| -less_than(Z,X).
% 1.67/1.84 0 [] -less_than(n,l).
% 1.67/1.84 0 [] less_than(one,l).
% 1.67/1.84 0 [] less_than(a(l),a(predecessor(l))).
% 1.67/1.84 0 [] less_than(X,n)|less_than(n,X)| -less_than(one,n)| -less_than(a(X),a(predecessor(n))).
% 1.67/1.84 0 [] -less_than(one,X)| -less_than(X,n)| -less_than(a(X),a(predecessor(X))).
% 1.67/1.84 end_of_list.
% 1.67/1.84
% 1.67/1.84 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.67/1.84
% 1.67/1.84 This ia a non-Horn set with equality. The strategy will be
% 1.67/1.84 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.67/1.84 deletion, with positive clauses in sos and nonpositive
% 1.67/1.84 clauses in usable.
% 1.67/1.84
% 1.67/1.84 dependent: set(knuth_bendix).
% 1.67/1.84 dependent: set(anl_eq).
% 1.67/1.84 dependent: set(para_from).
% 1.67/1.84 dependent: set(para_into).
% 1.67/1.84 dependent: clear(para_from_right).
% 1.67/1.84 dependent: clear(para_into_right).
% 1.67/1.84 dependent: set(para_from_vars).
% 1.67/1.84 dependent: set(eq_units_both_ways).
% 1.67/1.84 dependent: set(dynamic_demod_all).
% 1.67/1.84 dependent: set(dynamic_demod).
% 1.67/1.84 dependent: set(order_eq).
% 1.67/1.84 dependent: set(back_demod).
% 1.67/1.84 dependent: set(lrpo).
% 1.67/1.84 dependent: set(hyper_res).
% 1.67/1.84 dependent: set(unit_deletion).
% 1.67/1.84 dependent: set(factor).
% 1.67/1.84
% 1.67/1.84 ------------> process usable:
% 1.67/1.84 ** KEPT (pick-wt=8): 1 [] A=B|predecessor(A)!=predecessor(B).
% 1.67/1.84 ** KEPT (pick-wt=8): 2 [] A=B|successor(A)!=successor(B).
% 1.67/1.84 ** KEPT (pick-wt=9): 3 [] less_than(A,B)| -less_than(A,C)| -less_than(C,B).
% 1.67/1.84 ** KEPT (pick-wt=3): 4 [] -less_than(A,A).
% 1.67/1.84 ** KEPT (pick-wt=6): 5 [] -less_than(A,B)| -less_than(B,A).
% 1.67/1.84 ** KEPT (pick-wt=9): 6 [] less_than(A,B)|C!=A| -less_than(C,B).
% 1.67/1.84 ** KEPT (pick-wt=9): 7 [] less_than(A,B)|C!=B| -less_than(A,C).
% 1.67/1.84 ** KEPT (pick-wt=3): 8 [] -less_than(n,l).
% 1.67/1.84 ** KEPT (pick-wt=15): 9 [] less_than(A,n)|less_than(n,A)| -less_than(one,n)| -less_than(a(A),a(predecessor(n))).
% 1.67/1.84 ** KEPT (pick-wt=12): 10 [] -less_than(one,A)| -less_than(A,n)| -less_than(a(A),a(predecessor(A))).
% 1.67/1.84
% 1.67/1.84 ------------> process sos:
% 1.67/1.84 ** KEPT (pick-wt=3): 12 [] A=A.
% 1.67/1.84 ** KEPT (pick-wt=5): 13 [] predecessor(successor(A))=A.
% 1.67/1.84 ---> New Demodulator: 14 [new_demod,13] predecessor(successor(A))=A.
% 1.67/1.84 ** KEPT (pick-wt=5): 15 [] successor(predecessor(A))=A.
% 1.67/1.84 ---> New Demodulator: 16 [new_demod,15] successor(predecessor(A))=A.
% 1.67/1.84 ** KEPT (pick-wt=4): 17 [] less_than(predecessor(A),A).
% 1.67/1.84 ** KEPT (pick-wt=4): 18 [] less_than(A,successor(A)).
% 1.67/1.84 ** KEPT (pick-wt=9): 19 [] less_than(A,B)|less_than(B,A)|A=B.
% 1.67/1.84 ** KEPT (pick-wt=3): 20 [] less_than(one,l).
% 1.67/1.84 ** KEPT (pick-wt=6): 21 [] less_than(a(l),a(predecessor(l))).
% 1.67/1.84 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A.
% 1.67/1.84 >>>> Starting back demodulation with 14.
% 1.67/1.84 >>>> Starting back demodulation with 16.
% 1.67/1.84
% 1.67/1.84 ======= end of input processing =======
% 1.67/1.84
% 1.67/1.84 =========== start of search ===========
% 1.67/1.84
% 1.67/1.84 -------- PROOF --------
% 1.67/1.84
% 1.67/1.84 -----> EMPTY CLAUSE at 0.02 sec ----> 276 [back_demod,11,demod,233,233,233,unit_del,20,21] $F.
% 1.67/1.84
% 1.67/1.84 Length of proof is 2. Level of proof is 1.
% 1.67/1.84
% 1.67/1.84 ---------------- PROOF ----------------
% 1.67/1.84 % SZS status Unsatisfiable
% 1.67/1.84 % SZS output start Refutation
% See solution above
% 1.67/1.84 ------------ end of proof -------------
% 1.67/1.84
% 1.67/1.84
% 1.67/1.84 Search stopped by max_proofs option.
% 1.67/1.84
% 1.67/1.84
% 1.67/1.84 Search stopped by max_proofs option.
% 1.67/1.84
% 1.67/1.84 ============ end of search ============
% 1.67/1.84
% 1.67/1.84 -------------- statistics -------------
% 1.67/1.84 clauses given 16
% 1.67/1.84 clauses generated 562
% 1.67/1.84 clauses kept 272
% 1.67/1.84 clauses forward subsumed 347
% 1.67/1.84 clauses back subsumed 0
% 1.67/1.84 Kbytes malloced 976
% 1.67/1.84
% 1.67/1.84 ----------- times (seconds) -----------
% 1.67/1.84 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.67/1.84 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.84 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.67/1.84
% 1.67/1.84 That finishes the proof of the theorem.
% 1.67/1.84
% 1.67/1.84 Process 31273 finished Wed Jul 27 05:40:39 2022
% 1.67/1.84 Otter interrupted
% 1.67/1.84 PROOF FOUND
%------------------------------------------------------------------------------