TSTP Solution File: CSR073+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR073+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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 4.35s 2.09s
% Output : CNFRefutation 4.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 12 unt; 0 nHn; 24 RR)
% Number of literals : 38 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 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 : 22 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_59,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-364ln70w/input.p',i_0_59) ).
cnf(i_0_15,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-364ln70w/input.p',i_0_15) ).
cnf(i_0_69,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-364ln70w/input.p',i_0_69) ).
cnf(i_0_18,plain,
( tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)
| ~ mtvisible(c_tptp_member237_mt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-364ln70w/input.p',i_0_18) ).
cnf(i_0_13,plain,
( tptptypes_8_400(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-364ln70w/input.p',i_0_13) ).
cnf(i_0_11,plain,
( tptptypes_7_396(X1,X2)
| ~ tptptypes_8_400(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-364ln70w/input.p',i_0_11) ).
cnf(i_0_9,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_396(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-364ln70w/input.p',i_0_9) ).
cnf(i_0_7,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-364ln70w/input.p',i_0_7) ).
cnf(i_0_68,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingababycarriage),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-364ln70w/input.p',i_0_68) ).
cnf(c_0_79,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_59 ).
cnf(c_0_80,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
i_0_15 ).
cnf(c_0_81,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
i_0_69 ).
cnf(c_0_82,plain,
( tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)
| ~ mtvisible(c_tptp_member237_mt) ),
i_0_18 ).
cnf(c_0_83,plain,
mtvisible(c_tptp_member237_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81])]) ).
cnf(c_0_84,plain,
( tptptypes_8_400(X1,X2)
| ~ tptptypes_9_401(X2,X1) ),
i_0_13 ).
cnf(c_0_85,plain,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]) ).
cnf(c_0_86,plain,
( tptptypes_7_396(X1,X2)
| ~ tptptypes_8_400(X1,X2) ),
i_0_11 ).
cnf(c_0_87,plain,
tptptypes_8_400(c_tptpcol_16_10258,c_pushingababycarriage),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_88,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_396(X1,X2) ),
i_0_9 ).
cnf(c_0_89,plain,
tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_90,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
i_0_7 ).
cnf(c_0_91,plain,
tptptypes_6_388(c_tptpcol_16_10258,c_pushingababycarriage),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_92,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingababycarriage),
i_0_68 ).
cnf(c_0_93,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR073+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n025.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Fri Jun 10 15:49:53 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 4.35/2.09 # ENIGMATIC: Solved by autoschedule:
% 4.35/2.09 # No SInE strategy applied
% 4.35/2.09 # Trying AutoSched0 for 150 seconds
% 4.35/2.09 # AutoSched0-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 4.35/2.09 # and selection function SelectNewComplexAHP.
% 4.35/2.09 #
% 4.35/2.09 # Preprocessing time : 0.024 s
% 4.35/2.09
% 4.35/2.09 # Proof found!
% 4.35/2.09 # SZS status Theorem
% 4.35/2.09 # SZS output start CNFRefutation
% See solution above
% 4.35/2.09 # Training examples: 0 positive, 0 negative
% 4.35/2.09
% 4.35/2.09 # -------------------------------------------------
% 4.35/2.09 # User time : 0.027 s
% 4.35/2.09 # System time : 0.006 s
% 4.35/2.09 # Total time : 0.033 s
% 4.35/2.09 # Maximum resident set size: 7124 pages
% 4.35/2.09
%------------------------------------------------------------------------------