%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV372+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 : n002.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:01 PM UTC 2026
% Result : Theorem 1.30s 1.79s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 11 unt; 0 def)
% Number of atoms : 70 ( 21 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 63 ( 29 ~; 19 |; 5 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 89 ( 15 sgn 59 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(l8_lX,lemma,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ phi(triple(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_lX) ).
fof(l8_co,conjecture,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_co) ).
fof(ax47,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax47) ).
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(l8_li56,lemma,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_pq(i(triple(X1,X2,X3)),X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_li56) ).
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(ax46,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax46) ).
fof(c_0_8,plain,
! [X1,X2] : ~ ok(triple(X1,X2,bad)),
inference(fof_simplification,[status(thm)],[ax40]) ).
fof(c_0_9,lemma,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ phi(triple(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[l8_lX]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[l8_co]) ).
fof(c_0_11,plain,
! [X284,X285] : ~ ok(triple(X284,X285,bad)),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_12,lemma,
! [X357,X358,X359] :
( ok(triple(X357,X358,X359))
| ~ phi(triple(X357,X358,X359)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
fof(c_0_13,plain,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax47]) ).
fof(c_0_14,negated_conjecture,
( phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))
& ~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_15,plain,
! [X318,X319,X320] :
( X319 = create_slb
| findmin_cpq_res(triple(X318,X319,X320)) = findmin_pqp_res(X318) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax51])])]) ).
fof(c_0_16,lemma,
! [X350,X351,X352,X353] :
( ( ~ contains_cpq(triple(X350,X351,X352),X353)
| contains_pq(i(triple(X350,X351,X352)),X353) )
& ( ~ contains_pq(i(triple(X350,X351,X352)),X353)
| contains_cpq(triple(X350,X351,X352),X353) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l8_li56])]) ).
fof(c_0_17,plain,
! [X280,X281,X282,X283] :
( ( ~ contains_cpq(triple(X280,X281,X282),X283)
| contains_slb(X281,X283) )
& ( ~ contains_slb(X281,X283)
| contains_cpq(triple(X280,X281,X282),X283) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])]) ).
cnf(c_0_18,plain,
~ ok(triple(X1,X2,bad)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,lemma,
( ok(triple(X1,X2,X3))
| ~ phi(triple(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X307,X308,X309] :
( X308 = create_slb
| contains_slb(X308,findmin_pqp_res(X307))
| findmin_cpq_eff(triple(X307,X308,X309)) = triple(X307,update_slb(X308,findmin_pqp_res(X307)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_13])])]) ).
cnf(c_0_21,negated_conjecture,
~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,lemma,
( contains_pq(i(triple(X1,X2,X3)),X4)
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( contains_cpq(triple(X3,X1,X4),X2)
| ~ contains_slb(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,lemma,
~ phi(triple(X1,X2,bad)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( esk6_0 = create_slb
| ~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,lemma,
( contains_pq(i(triple(X1,X2,X3)),X4)
| ~ contains_slb(X2,X4) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,lemma,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| ~ phi(findmin_cpq_eff(triple(X2,X1,X3))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_31,negated_conjecture,
( esk6_0 = create_slb
| ~ contains_slb(esk6_0,findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_32,plain,
! [X305,X306] : findmin_cpq_eff(triple(X305,create_slb,X306)) = triple(X305,create_slb,bad),
inference(variable_rename,[status(thm)],[ax46]) ).
cnf(c_0_33,negated_conjecture,
esk6_0 = create_slb,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_33]),c_0_34]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV372+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12 % 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.16/0.33 % Computer : n002.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 05:05:31 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.30/1.79 % Version : CSE_E---1.7
% 1.30/1.79 % Problem : theBenchmark.p
% 1.30/1.79 % SZS status Theorem for theBenchmark.p
% 1.30/1.79 % SZS output start CNFRefutation
% See solution above
% 1.30/1.79 % Total time : 1.424s
%------------------------------------------------------------------------------