TSTP Solution File: CSR062+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR062+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 600s
% DateTime : Fri Jul 15 02:47:14 EDT 2022
% Result : Theorem 7.56s 2.32s
% Output : CNFRefutation 7.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 14 unt; 0 nHn; 24 RR)
% Number of literals : 36 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 18 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_53,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rdov_h9v/input.p',i_0_53) ).
cnf(i_0_13,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rdov_h9v/input.p',i_0_13) ).
cnf(i_0_63,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rdov_h9v/input.p',i_0_63) ).
cnf(i_0_12,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rdov_h9v/input.p',i_0_12) ).
cnf(i_0_14,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rdov_h9v/input.p',i_0_14) ).
cnf(i_0_11,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rdov_h9v/input.p',i_0_11) ).
cnf(i_0_9,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rdov_h9v/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-rdov_h9v/input.p',i_0_7) ).
cnf(i_0_62,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rdov_h9v/input.p',i_0_62) ).
cnf(c_0_73,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_53 ).
cnf(c_0_74,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
i_0_13 ).
cnf(c_0_75,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
i_0_63 ).
cnf(c_0_76,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_12 ).
cnf(c_0_77,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]) ).
cnf(c_0_78,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
i_0_14 ).
cnf(c_0_79,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_76]),c_0_77])]) ).
cnf(c_0_80,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
i_0_11 ).
cnf(c_0_81,plain,
tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]) ).
cnf(c_0_82,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
i_0_9 ).
cnf(c_0_83,plain,
tptptypes_7_389(c_pushingwithfingers,c_tptpcol_15_4027),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_84,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
i_0_7 ).
cnf(c_0_85,plain,
tptptypes_6_388(c_tptpcol_15_4027,c_pushingwithfingers),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_86,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
i_0_62 ).
cnf(c_0_87,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR062+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 17:54:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.56/2.32 # ENIGMATIC: Solved by autoschedule:
% 7.56/2.32 # No SInE strategy applied
% 7.56/2.32 # Trying AutoSched0 for 150 seconds
% 7.56/2.32 # AutoSched0-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 7.56/2.32 # and selection function SelectNewComplexAHP.
% 7.56/2.32 #
% 7.56/2.32 # Preprocessing time : 0.014 s
% 7.56/2.32
% 7.56/2.32 # Proof found!
% 7.56/2.32 # SZS status Theorem
% 7.56/2.32 # SZS output start CNFRefutation
% See solution above
% 7.56/2.32 # Training examples: 0 positive, 0 negative
% 7.56/2.32
% 7.56/2.32 # -------------------------------------------------
% 7.56/2.32 # User time : 0.017 s
% 7.56/2.32 # System time : 0.004 s
% 7.56/2.32 # Total time : 0.021 s
% 7.56/2.32 # Maximum resident set size: 7120 pages
% 7.56/2.32
%------------------------------------------------------------------------------