TSTP Solution File: CSR073+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR073+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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 : 600s
% DateTime : Fri Jul 15 02:47:26 EDT 2022
% Result : Theorem 8.65s 2.65s
% Output : CNFRefutation 8.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 17 ~; 14 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 34 ( 1 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query123,conjecture,
? [X5] :
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_387(X5,c_pushingababycarriage) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query123) ).
fof(ax1_1123,axiom,
! [X20,X21] :
( ( mtvisible(X20)
& genlmt(X20,X21) )
=> mtvisible(X21) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_1123) ).
fof(ax1_157,axiom,
( mtvisible(c_tptp_member237_mt)
=> tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_157) ).
fof(ax1_198,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_198) ).
fof(ax1_108,axiom,
! [X5,X6] :
( tptptypes_9_401(X5,X6)
=> tptptypes_8_400(X6,X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_108) ).
fof(ax1_174,axiom,
! [X5,X6] :
( tptptypes_8_400(X5,X6)
=> tptptypes_7_396(X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_174) ).
fof(ax1_409,axiom,
! [X5,X6] :
( tptptypes_7_396(X5,X6)
=> tptptypes_6_388(X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_409) ).
fof(ax1_99,axiom,
! [X5,X6] :
( tptptypes_6_388(X5,X6)
=> tptptypes_5_387(X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_99) ).
fof(c_0_8,negated_conjecture,
~ ? [X5] :
( mtvisible(c_tptp_spindlecollectormt)
=> tptptypes_5_387(X5,c_pushingababycarriage) ),
inference(assume_negation,[status(cth)],[query123]) ).
fof(c_0_9,plain,
! [X1128,X1129] :
( ~ mtvisible(X1128)
| ~ genlmt(X1128,X1129)
| mtvisible(X1129) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])]) ).
fof(c_0_10,negated_conjecture,
! [X1143] :
( mtvisible(c_tptp_spindlecollectormt)
& ~ tptptypes_5_387(X1143,c_pushingababycarriage) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
fof(c_0_11,plain,
( ~ mtvisible(c_tptp_member237_mt)
| tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
inference(fof_nnf,[status(thm)],[ax1_157]) ).
cnf(c_0_12,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
inference(split_conjunct,[status(thm)],[ax1_198]) ).
cnf(c_0_14,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X70,X71] :
( ~ tptptypes_9_401(X70,X71)
| tptptypes_8_400(X71,X70) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_108])]) ).
cnf(c_0_16,plain,
( tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)
| ~ mtvisible(c_tptp_member237_mt) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
mtvisible(c_tptp_member237_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
fof(c_0_18,plain,
! [X98,X99] :
( ~ tptptypes_8_400(X98,X99)
| tptptypes_7_396(X98,X99) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_174])]) ).
cnf(c_0_19,plain,
( tptptypes_8_400(X2,X1)
| ~ tptptypes_9_401(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
fof(c_0_21,plain,
! [X197,X198] :
( ~ tptptypes_7_396(X197,X198)
| tptptypes_6_388(X197,X198) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_409])]) ).
cnf(c_0_22,plain,
( tptptypes_7_396(X1,X2)
| ~ tptptypes_8_400(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
tptptypes_8_400(c_tptpcol_16_10258,c_pushingababycarriage),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_24,plain,
! [X65,X66] :
( ~ tptptypes_6_388(X65,X66)
| tptptypes_5_387(X65,X66) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_99])]) ).
cnf(c_0_25,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_396(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
tptptypes_6_388(c_tptpcol_16_10258,c_pushingababycarriage),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingababycarriage),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR073+2 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 11 14:09:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.65/2.65 # ENIGMATIC: Solved by autoschedule:
% 8.65/2.65 # No SInE strategy applied
% 8.65/2.65 # Trying AutoSched0 for 150 seconds
% 8.65/2.65 # AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S2S
% 8.65/2.65 # and selection function SelectNewComplexAHP.
% 8.65/2.65 #
% 8.65/2.65 # Preprocessing time : 0.032 s
% 8.65/2.65
% 8.65/2.65 # Proof found!
% 8.65/2.65 # SZS status Theorem
% 8.65/2.65 # SZS output start CNFRefutation
% See solution above
% 8.65/2.65 # Training examples: 0 positive, 0 negative
% 8.65/2.65
% 8.65/2.65 # -------------------------------------------------
% 8.65/2.65 # User time : 0.088 s
% 8.65/2.65 # System time : 0.012 s
% 8.65/2.65 # Total time : 0.101 s
% 8.65/2.65 # Maximum resident set size: 7124 pages
% 8.65/2.65
%------------------------------------------------------------------------------