TSTP Solution File: SWV232+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV232+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n026.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 May 31 12:40:58 EDT 2023
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 121 ( 83 equ)
% Maximal formula atoms : 28 ( 9 avg)
% Number of connectives : 163 ( 55 ~; 22 |; 78 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 16 (; 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ! [A,B] :
( ( leq(n0,A)
& leq(n0,B)
& leq(A,n5)
& leq(B,n5) )
=> a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) )
=> ! [C,D] :
( ( leq(n0,C)
& leq(n0,D)
& leq(C,n2)
& leq(D,n2) )
=> ( ( ~ ( n0 = C
& n1 = D )
& ~ ( n0 = C
& n2 = D )
& ~ ( n0 = D
& n2 = C )
& ~ ( n1 = C
& n1 = D )
& ~ ( n1 = C
& n2 = D )
& ~ ( n1 = D
& n2 = C )
& ~ ( n2 = C
& n2 = D )
& n0 = D
& n1 = C
& n1 = D
& n2 = C )
=> a_select2(rho,n1) = n0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ! [A,B] :
( ( leq(n0,A)
& leq(n0,B)
& leq(A,n5)
& leq(B,n5) )
=> a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) )
=> ! [C,D] :
( ( leq(n0,C)
& leq(n0,D)
& leq(C,n2)
& leq(D,n2) )
=> ( ( ~ ( n0 = C
& n1 = D )
& ~ ( n0 = C
& n2 = D )
& ~ ( n0 = D
& n2 = C )
& ~ ( n1 = C
& n1 = D )
& ~ ( n1 = C
& n2 = D )
& ~ ( n1 = D
& n2 = C )
& ~ ( n2 = C
& n2 = D )
& n0 = D
& n1 = C
& n1 = D
& n2 = C )
=> a_select2(rho,n1) = n0 ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f64,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f91,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f244,plain,
( ! [A,B] :
( ~ leq(n0,A)
| ~ leq(n0,B)
| ~ leq(A,n5)
| ~ leq(B,n5)
| a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) )
& ? [C,D] :
( leq(n0,C)
& leq(n0,D)
& leq(C,n2)
& leq(D,n2)
& ( n0 != C
| n1 != D )
& ( n0 != C
| n2 != D )
& ( n0 != D
| n2 != C )
& ( n1 != C
| n1 != D )
& ( n1 != C
| n2 != D )
& ( n1 != D
| n2 != C )
& ( n2 != C
| n2 != D )
& n0 = D
& n1 = C
& n1 = D
& n2 = C
& a_select2(rho,n1) != n0 ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f245,plain,
( ! [A,B] :
( ~ leq(n0,A)
| ~ leq(n0,B)
| ~ leq(A,n5)
| ~ leq(B,n5)
| a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) )
& leq(n0,sk0_23)
& leq(n0,sk0_24)
& leq(sk0_23,n2)
& leq(sk0_24,n2)
& ( n0 != sk0_23
| n1 != sk0_24 )
& ( n0 != sk0_23
| n2 != sk0_24 )
& ( n0 != sk0_24
| n2 != sk0_23 )
& ( n1 != sk0_23
| n1 != sk0_24 )
& ( n1 != sk0_23
| n2 != sk0_24 )
& ( n1 != sk0_24
| n2 != sk0_23 )
& ( n2 != sk0_23
| n2 != sk0_24 )
& n0 = sk0_24
& n1 = sk0_23
& n1 = sk0_24
& n2 = sk0_23
& a_select2(rho,n1) != n0 ),
inference(skolemization,[status(esa)],[f244]) ).
fof(f258,plain,
n0 = sk0_24,
inference(cnf_transformation,[status(esa)],[f245]) ).
fof(f260,plain,
n1 = sk0_24,
inference(cnf_transformation,[status(esa)],[f245]) ).
fof(f272,plain,
gt(n1,n0),
inference(cnf_transformation,[status(esa)],[f64]) ).
fof(f355,plain,
n1 = n0,
inference(forward_demodulation,[status(thm)],[f258,f260]) ).
fof(f365,plain,
gt(n0,n0),
inference(forward_demodulation,[status(thm)],[f355,f272]) ).
fof(f369,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f365,f91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV232+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue May 30 12:00:58 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.36 % Drodi V3.5.1
% 0.12/0.38 % Refutation found
% 0.12/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.38 % Elapsed time: 0.029460 seconds
% 0.12/0.38 % CPU time: 0.044578 seconds
% 0.12/0.38 % Memory used: 17.846 MB
%------------------------------------------------------------------------------