TSTP Solution File: CSR055+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR055+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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.31s 2.10s
% Output : CNFRefutation 4.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_5,plain,
( ~ individual(X1)
| ~ collection(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fe8ly2ql/lgb.p',i_0_5) ).
cnf(i_0_1,plain,
individual(c_xskijump_thegame),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fe8ly2ql/lgb.p',i_0_1) ).
cnf(i_0_32,plain,
( collection(X1)
| ~ disjointwith(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fe8ly2ql/lgb.p',i_0_32) ).
cnf(i_0_56,negated_conjecture,
disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fe8ly2ql/lgb.p',i_0_56) ).
cnf(c_0_61,plain,
( ~ individual(X1)
| ~ collection(X1) ),
i_0_5 ).
cnf(c_0_62,plain,
individual(c_xskijump_thegame),
i_0_1 ).
cnf(c_0_63,plain,
( collection(X1)
| ~ disjointwith(X1,X2) ),
i_0_32 ).
cnf(c_0_64,negated_conjecture,
disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
i_0_56 ).
cnf(c_0_65,plain,
~ collection(c_xskijump_thegame),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR055+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.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 21:58:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.31/2.10 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.31/2.10 # No SInE strategy applied
% 4.31/2.10 # Trying AutoSched0 for 150 seconds
% 4.31/2.10 # AutoSched0-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 4.31/2.10 # and selection function SelectNewComplexAHP.
% 4.31/2.10 #
% 4.31/2.10 # Preprocessing time : 0.014 s
% 4.31/2.10
% 4.31/2.10 # Proof found!
% 4.31/2.10 # SZS status Theorem
% 4.31/2.10 # SZS output start CNFRefutation
% See solution above
% 4.31/2.10 # Training examples: 0 positive, 0 negative
% 4.31/2.10
% 4.31/2.10 # -------------------------------------------------
% 4.31/2.10 # User time : 0.017 s
% 4.31/2.10 # System time : 0.002 s
% 4.31/2.10 # Total time : 0.019 s
% 4.31/2.10 # Maximum resident set size: 7128 pages
% 4.31/2.10
%------------------------------------------------------------------------------