%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV119+1 : TPTP v9.2.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 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 : Tue May 5 05:20:52 PM UTC 2026
% Result : Theorem 0.18s 1.53s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 4 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 12 ( 3 ~; 0 |; 5 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0012,conjecture,
( ( leq(n0,pv49)
& leq(pv49,minus(n6,n1)) )
=> ( lt(n0,a_select2(sigma,pv49))
=> true ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0012) ).
fof(ttrue,axiom,
true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',ttrue) ).
fof(c_0_2,negated_conjecture,
~ ( ( leq(n0,pv49)
& leq(pv49,minus(n6,n1)) )
=> ( lt(n0,a_select2(sigma,pv49))
=> true ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0012]) ).
fof(c_0_3,negated_conjecture,
( leq(n0,pv49)
& leq(pv49,minus(n6,n1))
& lt(n0,a_select2(sigma,pv49))
& ~ true ),
inference(fof_nnf,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
~ true,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,plain,
true,
inference(split_conjunct,[status(thm)],[ttrue]) ).
cnf(c_0_6,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SWV119+1 : TPTP v9.2.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.08/0.25 % Computer : n024.cluster.edu
% 0.08/0.25 % Model : x86_64 x86_64
% 0.08/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.25 % Memory : 8042.1875MB
% 0.08/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.25 % CPULimit : 300
% 0.08/0.25 % WCLimit : 300
% 0.08/0.25 % DateTime : Mon May 4 23:56:41 EDT 2026
% 0.08/0.26 % CPUTime :
% 0.08/0.26 % start to proof: theBenchmark
% 0.18/1.53 % Version : CSE_E---1.7
% 0.18/1.53 % Problem : theBenchmark.p
% 0.18/1.53 % SZS status Theorem for theBenchmark.p
% 0.18/1.53 % SZS output start CNFRefutation
% See solution above
% 0.18/1.53 % Total time : 1.264s
%------------------------------------------------------------------------------