%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV373+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n014.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:22:02 PM UTC 2026
% Result : Theorem 1.23s 1.68s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 43 ( 10 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 43 ( 22 ~; 10 |; 6 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 41 ( 6 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l9_co,conjecture,
! [X1,X2,X3] :
( ~ contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l9_co) ).
fof(ax51,axiom,
! [X1,X2,X3,X4] :
( X2 != create_slb
=> findmin_cpq_res(triple(X1,X2,X3)) = findmin_pqp_res(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(l9_l10,lemma,
! [X1,X2,X3] :
( ok(findmin_cpq_eff(triple(X1,X2,X3)))
=> ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l9_l10) ).
fof(ax39,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax39) ).
fof(ax20,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax20) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ contains_cpq(triple(X1,X2,X3),findmin_cpq_res(triple(X1,X2,X3)))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l9_co])]) ).
fof(c_0_6,negated_conjecture,
( ~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0)))
& ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,plain,
! [X237,X238,X239] :
( X238 = create_slb
| findmin_cpq_res(triple(X237,X238,X239)) = findmin_pqp_res(X237) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax51])])]) ).
fof(c_0_8,lemma,
! [X242,X243,X244] :
( ( X243 != create_slb
| ~ ok(findmin_cpq_eff(triple(X242,X243,X244))) )
& ( contains_slb(X243,findmin_pqp_res(X242))
| ~ ok(findmin_cpq_eff(triple(X242,X243,X244))) )
& ( less_than(lookup_slb(X243,findmin_pqp_res(X242)),findmin_pqp_res(X242))
| ~ ok(findmin_cpq_eff(triple(X242,X243,X244))) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l9_l10])])]) ).
cnf(c_0_9,negated_conjecture,
~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X199,X200,X201,X202] :
( ( ~ contains_cpq(triple(X199,X200,X201),X202)
| contains_slb(X200,X202) )
& ( ~ contains_slb(X200,X202)
| contains_cpq(triple(X199,X200,X201),X202) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])]) ).
cnf(c_0_12,lemma,
( contains_slb(X1,findmin_pqp_res(X2))
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[ax20]) ).
cnf(c_0_15,negated_conjecture,
( esk2_0 = create_slb
| ~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
( contains_cpq(triple(X3,X1,X4),X2)
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
contains_slb(esk2_0,findmin_pqp_res(esk1_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,plain,
! [X141] : ~ contains_slb(create_slb,X141),
inference(variable_rename,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 = create_slb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWV373+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.09 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.11/0.30 % Computer : n014.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Tue May 5 05:05:36 EDT 2026
% 0.11/0.30 % CPUTime :
% 0.11/0.31 % start to proof: theBenchmark
% 1.23/1.68 % Version : CSE_E---1.7
% 1.23/1.68 % Problem : theBenchmark.p
% 1.23/1.68 % SZS status Theorem for theBenchmark.p
% 1.23/1.68 % SZS output start CNFRefutation
% See solution above
% 1.23/1.68 % Total time : 1.370s
%------------------------------------------------------------------------------