TSTP Solution File: CSR031+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR031+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:46:42 EDT 2022
% Result : Theorem 7.31s 3.13s
% Output : CNFRefutation 7.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 10 RR)
% Number of literals : 14 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 6 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_687,plain,
( ~ individual(X1)
| ~ collection(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-enepd_ue/lgb.p',i_0_687) ).
cnf(i_0_560,plain,
individual(c_tptptptpcol_16_8398),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-enepd_ue/lgb.p',i_0_560) ).
cnf(i_0_2168,plain,
( collection(X1)
| ~ disjointwith(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-enepd_ue/lgb.p',i_0_2168) ).
cnf(i_0_2500,negated_conjecture,
disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-enepd_ue/lgb.p',i_0_2500) ).
cnf(c_0_2505,plain,
( ~ individual(X1)
| ~ collection(X1) ),
i_0_687 ).
cnf(c_0_2506,plain,
individual(c_tptptptpcol_16_8398),
i_0_560 ).
cnf(c_0_2507,plain,
( collection(X1)
| ~ disjointwith(X1,X2) ),
i_0_2168 ).
cnf(c_0_2508,negated_conjecture,
disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
i_0_2500 ).
cnf(c_0_2509,plain,
~ collection(c_tptptptpcol_16_8398),
inference(spm,[status(thm)],[c_0_2505,c_0_2506]) ).
cnf(c_0_2510,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2507,c_0_2508]),c_0_2509]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : CSR031+3 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n020.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Fri Jun 10 03:31:52 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.40/0.59 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.40/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.40/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.31/3.13 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.31/3.13 # SinE strategy is gf600_h_gu_R05_F100_L20000
% 7.31/3.13 # Trying AutoSched0 for 150 seconds
% 7.31/3.13 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S063N
% 7.31/3.13 # and selection function SelectMaxLComplexAvoidPosUPred.
% 7.31/3.13 #
% 7.31/3.13 # Preprocessing time : 0.031 s
% 7.31/3.13 # Presaturation interreduction done
% 7.31/3.13
% 7.31/3.13 # Proof found!
% 7.31/3.13 # SZS status Theorem
% 7.31/3.13 # SZS output start CNFRefutation
% See solution above
% 7.31/3.13 # Training examples: 0 positive, 0 negative
% 7.31/3.13
% 7.31/3.13 # -------------------------------------------------
% 7.31/3.13 # User time : 0.066 s
% 7.31/3.13 # System time : 0.012 s
% 7.31/3.13 # Total time : 0.078 s
% 7.31/3.13 # Maximum resident set size: 7128 pages
% 7.31/3.13
%------------------------------------------------------------------------------