TSTP Solution File: CSR056+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR056+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:07 EDT 2022
% Result : Theorem 4.11s 2.15s
% Output : CNFRefutation 4.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 12 unt; 0 nHn; 22 RR)
% Number of literals : 36 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 11 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_47,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e1qni25u/input.p',i_0_47) ).
cnf(i_0_9,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e1qni25u/input.p',i_0_9) ).
cnf(i_0_70,negated_conjecture,
mtvisible(c_tptp_member3717_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e1qni25u/input.p',i_0_70) ).
cnf(i_0_2,plain,
( supplies(X1)
| ~ artsupplies(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e1qni25u/input.p',i_0_2) ).
cnf(i_0_12,plain,
( artsupplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e1qni25u/input.p',i_0_12) ).
cnf(i_0_8,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e1qni25u/input.p',i_0_8) ).
cnf(i_0_10,plain,
( tptpofobject(X1,f_tptpquantityfn_14(n_232))
| ~ supplies(X1)
| ~ mtvisible(c_tptp_spindleheadmt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e1qni25u/input.p',i_0_10) ).
cnf(i_0_69,negated_conjecture,
~ tptpofobject(c_tptpartsupplies,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e1qni25u/input.p',i_0_69) ).
cnf(c_0_79,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_47 ).
cnf(c_0_80,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
i_0_9 ).
cnf(c_0_81,negated_conjecture,
mtvisible(c_tptp_member3717_mt),
i_0_70 ).
cnf(c_0_82,plain,
( supplies(X1)
| ~ artsupplies(X1) ),
i_0_2 ).
cnf(c_0_83,plain,
( artsupplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
i_0_12 ).
cnf(c_0_84,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_8 ).
cnf(c_0_85,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81])]) ).
cnf(c_0_86,plain,
( tptpofobject(X1,f_tptpquantityfn_14(n_232))
| ~ supplies(X1)
| ~ mtvisible(c_tptp_spindleheadmt) ),
i_0_10 ).
cnf(c_0_87,plain,
( supplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_88,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_84]),c_0_85])]) ).
cnf(c_0_89,negated_conjecture,
~ tptpofobject(c_tptpartsupplies,X1),
i_0_69 ).
cnf(c_0_90,plain,
( tptpofobject(X1,f_tptpquantityfn_14(n_232))
| ~ supplies(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_85])]) ).
cnf(c_0_91,plain,
supplies(c_tptpartsupplies),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_92,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : CSR056+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Thu Jun 9 21:50:55 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.15/0.38 # ENIGMATIC: Selected complete mode:
% 4.11/2.15 # ENIGMATIC: Solved by autoschedule:
% 4.11/2.15 # No SInE strategy applied
% 4.11/2.15 # Trying AutoSched0 for 150 seconds
% 4.11/2.15 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_S0Y
% 4.11/2.15 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.11/2.15 #
% 4.11/2.15 # Preprocessing time : 0.017 s
% 4.11/2.15
% 4.11/2.15 # Proof found!
% 4.11/2.15 # SZS status Theorem
% 4.11/2.15 # SZS output start CNFRefutation
% See solution above
% 4.11/2.15 # Training examples: 0 positive, 0 negative
% 4.11/2.15
% 4.11/2.15 # -------------------------------------------------
% 4.11/2.15 # User time : 0.021 s
% 4.11/2.15 # System time : 0.002 s
% 4.11/2.15 # Total time : 0.024 s
% 4.11/2.15 # Maximum resident set size: 7116 pages
% 4.11/2.15
%------------------------------------------------------------------------------