%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUN070+1 : TPTP v9.2.1. Released v7.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 : n019.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:00:50 PM UTC 2026
% Result : Theorem 1.27s 1.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 88 ( 37 ~; 28 |; 23 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-1 aty)
% Number of variables : 55 ( 2 sgn 16 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(onepluszeroidone,conjecture,
? [X63] :
( ? [X46] :
( ? [X40] :
( r1(X40)
& r3(X46,X40,X63) )
& ? [X41] :
( r1(X41)
& r2(X41,X46) ) )
& ? [X47] :
( id(X63,X47)
& ? [X49] :
( r1(X49)
& r2(X49,X47) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',onepluszeroidone) ).
fof(axiom_4a,axiom,
! [X54] :
? [X55] :
( id(X55,X54)
& ? [X56] :
( r1(X56)
& r3(X54,X56,X55) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_4a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_2) ).
fof(axiom_5,axiom,
! [X14] : id(X14,X14),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_5) ).
fof(c_0_4,negated_conjecture,
~ ? [X63] :
( ? [X46] :
( ? [X40] :
( r1(X40)
& r3(X46,X40,X63) )
& ? [X41] :
( r1(X41)
& r2(X41,X46) ) )
& ? [X47] :
( id(X63,X47)
& ? [X49] :
( r1(X49)
& r2(X49,X47) ) ) ),
inference(assume_negation,[status(cth)],[onepluszeroidone]) ).
fof(c_0_5,negated_conjecture,
! [X208,X209,X210,X211,X212,X213] :
( ~ r1(X210)
| ~ r3(X209,X210,X208)
| ~ r1(X211)
| ~ r2(X211,X209)
| ~ id(X208,X212)
| ~ r1(X213)
| ~ r2(X213,X212) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X194] :
( id(esk13_1(X194),X194)
& r1(esk14_1(X194))
& r3(X194,esk14_1(X194),esk13_1(X194)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_7,plain,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_8,negated_conjecture,
( ~ r1(X1)
| ~ r3(X2,X1,X3)
| ~ r1(X4)
| ~ r2(X4,X2)
| ~ id(X3,X5)
| ~ r1(X6)
| ~ r2(X6,X5) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
r3(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X143,X145] :
( ( ~ r2(X143,X145)
| id(X145,esk2_1(X143)) )
& ( ~ id(X145,esk2_1(X143))
| id(X145,esk2_1(X143)) )
& ( ~ r2(X143,X145)
| r2(X143,X145) )
& ( ~ id(X145,esk2_1(X143))
| r2(X143,X145) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
fof(c_0_12,plain,
! [X154] : id(X154,X154),
inference(variable_rename,[status(thm)],[axiom_5]) ).
cnf(c_0_13,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X3,X4)
| ~ r1(X1)
| ~ r1(X3)
| ~ id(esk13_1(X4),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_14,plain,
id(esk13_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( r2(X2,X1)
| ~ id(X1,esk2_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
id(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X3,X2)
| ~ r1(X1)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
r2(X1,esk2_1(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ r2(X1,esk2_1(X2))
| ~ r1(X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN070+1 : TPTP v9.2.1. Released v7.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.14/0.33 % Computer : n019.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 01:22:44 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/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.369s
%------------------------------------------------------------------------------