%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV377+1 : TPTP v9.2.1. Released 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 : n007.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.27s 1.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 12 unt; 0 def)
% Number of atoms : 28 ( 8 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 14 ~; 2 |; 1 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 43 ( 7 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l13_co,conjecture,
! [X1,X2,X3,X4] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(insert_cpq(triple(X1,X2,X3),X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l13_co) ).
fof(ax41,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(ax42,axiom,
! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax42) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(insert_cpq(triple(X1,X2,X3),X4)) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l13_co])]) ).
fof(c_0_5,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[ax41]) ).
fof(c_0_6,negated_conjecture,
( ~ ok(triple(esk1_0,esk2_0,esk3_0))
& ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X203,X204,X205] :
( ok(triple(X203,X204,X205))
| X205 = bad ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_8,plain,
! [X1,X2] : ~ ok(triple(X1,X2,bad)),
inference(fof_simplification,[status(thm)],[ax40]) ).
cnf(c_0_9,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ok(triple(X1,X2,X3))
| X3 = bad ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X201,X202] : ~ ok(triple(X201,X202,bad)),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X206,X207,X208,X209] : insert_cpq(triple(X206,X207,X208),X209) = triple(insert_pqp(X206,X209),insert_slb(X207,pair(X209,bottom)),X208),
inference(variable_rename,[status(thm)],[ax42]) ).
cnf(c_0_13,negated_conjecture,
ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
esk3_0 = bad,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
~ ok(triple(X1,X2,bad)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
ok(insert_cpq(triple(esk1_0,esk2_0,bad),esk4_0)),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
~ ok(insert_cpq(triple(X1,X2,bad),X3)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV377+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12 % 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.15/0.33 % Computer : n007.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 05:04:24 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.27/1.72 % Version : CSE_E---1.7
% 1.27/1.72 % Problem : theBenchmark.p
% 1.27/1.72 % SZS status Theorem for theBenchmark.p
% 1.27/1.72 % SZS output start CNFRefutation
% See solution above
% 1.27/1.72 % Total time : 1.372s
%------------------------------------------------------------------------------