TSTP Solution File: GEO082+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO082+1 : TPTP v8.1.0. Released v2.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 : Sat Jul 16 03:43:12 EDT 2022
% Result : Theorem 7.34s 2.29s
% Output : CNFRefutation 7.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 8 unt; 3 nHn; 15 RR)
% Number of literals : 36 ( 8 equ; 14 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_40,plain,
( incident_c(X1,X2)
| ~ part_of(X3,X2)
| ~ incident_c(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-86d1mcte/lgb.p',i_0_40) ).
cnf(i_0_37,negated_conjecture,
part_of(esk12_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-86d1mcte/lgb.p',i_0_37) ).
cnf(i_0_36,negated_conjecture,
part_of(esk13_0,esk12_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-86d1mcte/lgb.p',i_0_36) ).
cnf(i_0_11,plain,
( X1 = X2
| incident_c(esk6_2(X1,X2),X2)
| incident_c(esk6_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-86d1mcte/lgb.p',i_0_11) ).
cnf(i_0_12,plain,
( X1 = X2
| ~ incident_c(esk6_2(X1,X2),X2)
| ~ incident_c(esk6_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-86d1mcte/lgb.p',i_0_12) ).
cnf(i_0_35,negated_conjecture,
esk12_0 != esk13_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-86d1mcte/lgb.p',i_0_35) ).
cnf(c_0_47,plain,
( incident_c(X1,X2)
| ~ part_of(X3,X2)
| ~ incident_c(X1,X3) ),
i_0_40 ).
cnf(c_0_48,negated_conjecture,
part_of(esk12_0,esk13_0),
i_0_37 ).
cnf(c_0_49,negated_conjecture,
part_of(esk13_0,esk12_0),
i_0_36 ).
cnf(c_0_50,negated_conjecture,
( incident_c(X1,esk13_0)
| ~ incident_c(X1,esk12_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
( X1 = X2
| incident_c(esk6_2(X1,X2),X2)
| incident_c(esk6_2(X1,X2),X1) ),
i_0_11 ).
cnf(c_0_52,plain,
( X1 = X2
| ~ incident_c(esk6_2(X1,X2),X2)
| ~ incident_c(esk6_2(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_53,negated_conjecture,
( incident_c(X1,esk12_0)
| ~ incident_c(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_49]) ).
cnf(c_0_54,plain,
( X1 = esk12_0
| incident_c(esk6_2(X1,esk12_0),esk13_0)
| incident_c(esk6_2(X1,esk12_0),X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
esk12_0 != esk13_0,
i_0_35 ).
cnf(c_0_56,plain,
( X1 = esk12_0
| ~ incident_c(esk6_2(X1,esk12_0),esk13_0)
| ~ incident_c(esk6_2(X1,esk12_0),X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
incident_c(esk6_2(esk13_0,esk12_0),esk13_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_54]),c_0_55]) ).
cnf(c_0_58,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_57])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GEO082+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 : Fri Jun 17 21:40:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.34/2.29 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.34/2.29 # No SInE strategy applied
% 7.34/2.29 # Trying AutoSched0 for 150 seconds
% 7.34/2.29 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 7.34/2.29 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.34/2.29 #
% 7.34/2.29 # Preprocessing time : 0.014 s
% 7.34/2.29
% 7.34/2.29 # Proof found!
% 7.34/2.29 # SZS status Theorem
% 7.34/2.29 # SZS output start CNFRefutation
% See solution above
% 7.34/2.29 # Training examples: 0 positive, 0 negative
% 7.34/2.29
% 7.34/2.29 # -------------------------------------------------
% 7.34/2.29 # User time : 0.015 s
% 7.34/2.29 # System time : 0.008 s
% 7.34/2.29 # Total time : 0.023 s
% 7.34/2.29 # Maximum resident set size: 7124 pages
% 7.34/2.29
%------------------------------------------------------------------------------