TSTP Solution File: CSR032+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR032+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:43 EDT 2022
% Result : Theorem 6.39s 3.74s
% Output : CNFRefutation 6.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 13 ( 2 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1570,plain,
( thing(X1)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3aw3x98n/lgb.p',i_0_1570) ).
cnf(i_0_2200,plain,
( isa(X1,c_thing)
| ~ thing(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3aw3x98n/lgb.p',i_0_2200) ).
cnf(i_0_2628,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3aw3x98n/lgb.p',i_0_2628) ).
cnf(c_0_2632,plain,
( thing(X1)
| X1 != X2 ),
i_0_1570 ).
cnf(c_0_2633,plain,
( isa(X1,c_thing)
| ~ thing(X1) ),
i_0_2200 ).
cnf(c_0_2634,plain,
thing(X1),
inference(er,[status(thm)],[c_0_2632]) ).
cnf(c_0_2635,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),X1),
i_0_2628 ).
cnf(c_0_2636,plain,
isa(X1,c_thing),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2633,c_0_2634])]) ).
cnf(c_0_2637,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_2635,c_0_2636]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : CSR032+4 : TPTP v8.1.0. Released v3.4.0.
% 0.09/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.32 % Computer : n026.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 18:55:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.43 # ENIGMATIC: Selected SinE mode:
% 0.86/1.03 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.86/1.03 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.86/1.03 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.86/1.03 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.39/3.74 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.39/3.74 # No SInE strategy applied
% 6.39/3.74 # Trying AutoSched0 for 150 seconds
% 6.39/3.74 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.39/3.74 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.39/3.74 #
% 6.39/3.74 # Preprocessing time : 0.027 s
% 6.39/3.74 # Presaturation interreduction done
% 6.39/3.74
% 6.39/3.74 # Proof found!
% 6.39/3.74 # SZS status Theorem
% 6.39/3.74 # SZS output start CNFRefutation
% See solution above
% 6.39/3.74 # Training examples: 0 positive, 0 negative
% 6.39/3.74
% 6.39/3.74 # -------------------------------------------------
% 6.39/3.74 # User time : 0.035 s
% 6.39/3.74 # System time : 0.005 s
% 6.39/3.74 # Total time : 0.040 s
% 6.39/3.74 # Maximum resident set size: 7124 pages
% 6.39/3.74
%------------------------------------------------------------------------------