%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV415+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 : n012.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:07 PM UTC 2026
% Result : Theorem 1.22s 1.65s
% Output : CNFRefutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 77 ( 28 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co2,conjecture,
! [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co2) ).
fof(main2_l12,lemma,
! [X1,X2,X3,X4,X5] : i(triple(X1,X3,X4)) = i(triple(X2,X3,X5)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main2_l12) ).
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/sandbox2/benchmark/Axioms/SWV007+3.ax',ax42) ).
fof(ax55,axiom,
! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax55) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
inference(assume_negation,[status(cth)],[co2]) ).
fof(c_0_5,lemma,
! [X346,X347,X348,X349,X350] : i(triple(X346,X348,X349)) = i(triple(X347,X348,X350)),
inference(variable_rename,[status(thm)],[main2_l12]) ).
fof(c_0_6,plain,
! [X285,X286,X287,X288] : insert_cpq(triple(X285,X286,X287),X288) = triple(insert_pqp(X285,X288),insert_slb(X286,pair(X288,bottom)),X287),
inference(variable_rename,[status(thm)],[ax42]) ).
fof(c_0_7,negated_conjecture,
i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)) != insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,lemma,
i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,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_6]) ).
cnf(c_0_10,negated_conjecture,
i(insert_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0)) != insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,lemma,
i(triple(X1,insert_slb(X2,pair(X3,bottom)),X4)) = i(insert_cpq(triple(X5,X2,X6),X3)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
i(triple(X1,insert_slb(esk6_0,pair(esk8_0,bottom)),X2)) != insert_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,lemma,
i(triple(X1,insert_slb(esk6_0,pair(esk8_0,bottom)),X2)) != insert_pq(i(triple(X3,esk6_0,X4)),esk8_0),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
fof(c_0_14,plain,
! [X321,X322,X323,X324,X325] : i(triple(X321,insert_slb(X322,pair(X324,X325)),X323)) = insert_pq(i(triple(X321,X322,X323)),X324),
inference(variable_rename,[status(thm)],[ax55]) ).
cnf(c_0_15,lemma,
i(insert_cpq(triple(X1,esk6_0,X2),esk8_0)) != insert_pq(i(triple(X3,esk6_0,X4)),esk8_0),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_16,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,lemma,
i(insert_cpq(triple(X1,esk6_0,X2),esk8_0)) != i(triple(X3,insert_slb(esk6_0,pair(esk8_0,X4)),X5)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,lemma,
i(insert_cpq(triple(X1,X2,X3),X4)) = i(insert_cpq(triple(X5,X2,X6),X4)),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_19,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_9]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SWV415+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.06 % 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.06/0.25 % Computer : n012.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Tue May 5 05:08:01 EDT 2026
% 0.06/0.25 % CPUTime :
% 0.06/0.26 % start to proof: theBenchmark
% 1.22/1.65 % Version : CSE_E---1.7
% 1.22/1.65 % Problem : theBenchmark.p
% 1.22/1.65 % SZS status Theorem for theBenchmark.p
% 1.22/1.65 % SZS output start CNFRefutation
% See solution above
% 1.22/1.65 % Total time : 1.364s
%------------------------------------------------------------------------------