TSTP Solution File: NUN088+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUN088+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n001.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 : Thu Aug 31 12:46:00 EDT 2023
% Result : Theorem 0.19s 0.61s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 30
% Syntax : Number of formulae : 40 ( 4 unt; 28 typ; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 41 ( 23 ~; 15 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 40 ( 24 >; 16 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 23 ( 23 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 1 sgn; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
id: ( $i * $i ) > $o ).
tff(decl_23,type,
r1: $i > $o ).
tff(decl_24,type,
r2: ( $i * $i ) > $o ).
tff(decl_25,type,
r3: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
r4: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
esk1_0: $i ).
tff(decl_28,type,
esk2_1: $i > $i ).
tff(decl_29,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_30,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_31,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_32,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_33,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_34,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_36,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_37,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_38,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_39,type,
esk13_1: $i > $i ).
tff(decl_40,type,
esk14_1: $i > $i ).
tff(decl_41,type,
esk15_1: $i > $i ).
tff(decl_42,type,
esk16_1: $i > $i ).
tff(decl_43,type,
esk17_1: $i > $i ).
tff(decl_44,type,
esk18_1: $i > $i ).
tff(decl_45,type,
esk19_1: $i > $i ).
tff(decl_46,type,
esk20_1: $i > $i ).
tff(decl_47,type,
esk21_0: $i ).
tff(decl_48,type,
esk22_0: $i ).
tff(decl_49,type,
esk23_0: $i ).
fof(axiom_7a,axiom,
! [X65,X66] :
( ! [X67] :
( ~ id(X67,X66)
| ~ r1(X67) )
| ~ r2(X65,X66) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_7a) ).
fof(zerounidone,conjecture,
! [X63] :
( ! [X46] :
( ~ id(X46,X63)
| ~ r1(X46) )
| ! [X47] :
( ~ r1(X47)
| ~ r2(X47,X63) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerounidone) ).
fof(c_0_2,plain,
! [X65,X66] :
( ! [X67] :
( ~ id(X67,X66)
| ~ r1(X67) )
| ~ r2(X65,X66) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
fof(c_0_3,negated_conjecture,
~ ! [X63] :
( ! [X46] :
( ~ id(X46,X63)
| ~ r1(X46) )
| ! [X47] :
( ~ r1(X47)
| ~ r2(X47,X63) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[zerounidone])]) ).
fof(c_0_4,plain,
! [X132,X133,X134] :
( ~ id(X134,X133)
| ~ r1(X134)
| ~ r2(X132,X133) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_2])]) ).
fof(c_0_5,negated_conjecture,
( id(esk22_0,esk21_0)
& r1(esk22_0)
& r1(esk23_0)
& r2(esk23_0,esk21_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( ~ id(X1,X2)
| ~ r1(X1)
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
r2(esk23_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ r1(X1)
| ~ id(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
r1(esk22_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
id(esk22_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN088+1 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n001.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Aug 27 09:39:47 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.19/0.59 start to proof: theBenchmark
% 0.19/0.61 % Version : CSE_E---1.5
% 0.19/0.61 % Problem : theBenchmark.p
% 0.19/0.61 % Proof found
% 0.19/0.61 % SZS status Theorem for theBenchmark.p
% 0.19/0.61 % SZS output start Proof
% See solution above
% 0.19/0.61 % Total time : 0.010000 s
% 0.19/0.61 % SZS output end Proof
% 0.19/0.61 % Total time : 0.013000 s
%------------------------------------------------------------------------------