TSTP Solution File: SWB025+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWB025+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Tue Jul 19 18:59:03 EDT 2022
% Result : Theorem 7.77s 2.32s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of clauses : 53 ( 33 unt; 0 nHn; 53 RR)
% Number of literals : 118 ( 0 equ; 68 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 17 con; 0-0 aty)
% Number of variables : 81 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( iext(X1,X2,X3)
| ~ iext(X4,X5,X3)
| ~ iext(X6,X2,X5)
| ~ iext(uri_rdf_first,X7,X4)
| ~ iext(uri_rdf_first,X8,X6)
| ~ iext(uri_rdf_rest,X8,X7)
| ~ iext(uri_owl_propertyChainAxiom,X1,X8)
| ~ iext(uri_rdf_rest,X7,uri_rdf_nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_4) ).
cnf(i_0_20,plain,
iext(uri_rdf_rest,esk9_0,uri_rdf_nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_20) ).
cnf(i_0_21,plain,
iext(uri_rdf_first,esk9_0,esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_21) ).
cnf(i_0_22,plain,
iext(uri_rdf_rest,esk8_0,esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_22) ).
cnf(i_0_23,plain,
iext(uri_rdf_first,esk8_0,uri_ex_hasUncle),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_23) ).
cnf(i_0_25,plain,
iext(uri_rdf_rest,esk7_0,uri_rdf_nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_25) ).
cnf(i_0_24,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_24) ).
cnf(i_0_10,plain,
( iext(X1,X2,X3)
| ~ iext(X4,X3,X2)
| ~ iext(uri_owl_inverseOf,X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_10) ).
cnf(i_0_19,plain,
iext(uri_owl_inverseOf,esk10_0,uri_ex_hasFather),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_19) ).
cnf(i_0_26,plain,
iext(uri_rdf_first,esk7_0,uri_ex_hasFather),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_26) ).
cnf(i_0_27,plain,
iext(uri_rdf_rest,esk6_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_27) ).
cnf(i_0_15,plain,
iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_15) ).
cnf(i_0_28,plain,
iext(uri_rdf_first,esk6_0,uri_ex_hasCousin),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_28) ).
cnf(i_0_18,plain,
iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_18) ).
cnf(i_0_29,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_29) ).
cnf(i_0_14,negated_conjecture,
( ~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)
| ~ iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_14) ).
cnf(i_0_16,plain,
iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_16) ).
cnf(i_0_17,plain,
iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfno65md/input.p',i_0_17) ).
cnf(c_0_48,plain,
( iext(X1,X2,X3)
| ~ iext(X4,X5,X3)
| ~ iext(X6,X2,X5)
| ~ iext(uri_rdf_first,X7,X4)
| ~ iext(uri_rdf_first,X8,X6)
| ~ iext(uri_rdf_rest,X8,X7)
| ~ iext(uri_owl_propertyChainAxiom,X1,X8)
| ~ iext(uri_rdf_rest,X7,uri_rdf_nil) ),
i_0_4 ).
cnf(c_0_49,plain,
iext(uri_rdf_rest,esk9_0,uri_rdf_nil),
i_0_20 ).
cnf(c_0_50,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_first,esk9_0,X4)
| ~ iext(uri_rdf_rest,X5,esk9_0)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_owl_propertyChainAxiom,X1,X5)
| ~ iext(X6,X2,X7)
| ~ iext(X4,X7,X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,plain,
iext(uri_rdf_first,esk9_0,esk10_0),
i_0_21 ).
cnf(c_0_52,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_rest,X4,esk9_0)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_owl_propertyChainAxiom,X1,X4)
| ~ iext(esk10_0,X6,X3)
| ~ iext(X5,X2,X6) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,plain,
iext(uri_rdf_rest,esk8_0,esk9_0),
i_0_22 ).
cnf(c_0_54,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_first,esk8_0,X4)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk8_0)
| ~ iext(esk10_0,X5,X3)
| ~ iext(X4,X2,X5) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,plain,
iext(uri_rdf_first,esk8_0,uri_ex_hasUncle),
i_0_23 ).
cnf(c_0_56,plain,
iext(uri_rdf_rest,esk7_0,uri_rdf_nil),
i_0_25 ).
cnf(c_0_57,plain,
( iext(X1,X2,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk8_0)
| ~ iext(esk10_0,X4,X3)
| ~ iext(uri_ex_hasUncle,X2,X4) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,esk8_0),
i_0_24 ).
cnf(c_0_59,plain,
( iext(X1,X2,X3)
| ~ iext(X4,X3,X2)
| ~ iext(uri_owl_inverseOf,X1,X4) ),
i_0_10 ).
cnf(c_0_60,plain,
iext(uri_owl_inverseOf,esk10_0,uri_ex_hasFather),
i_0_19 ).
cnf(c_0_61,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_first,esk7_0,X4)
| ~ iext(uri_rdf_rest,X5,esk7_0)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_owl_propertyChainAxiom,X1,X5)
| ~ iext(X6,X2,X7)
| ~ iext(X4,X7,X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_56]) ).
cnf(c_0_62,plain,
iext(uri_rdf_first,esk7_0,uri_ex_hasFather),
i_0_26 ).
cnf(c_0_63,plain,
( iext(uri_ex_hasCousin,X1,X2)
| ~ iext(esk10_0,X3,X2)
| ~ iext(uri_ex_hasUncle,X1,X3) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
( iext(esk10_0,X1,X2)
| ~ iext(uri_ex_hasFather,X2,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_rest,X4,esk7_0)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_owl_propertyChainAxiom,X1,X4)
| ~ iext(uri_ex_hasFather,X6,X3)
| ~ iext(X5,X2,X6) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,plain,
iext(uri_rdf_rest,esk6_0,esk7_0),
i_0_27 ).
cnf(c_0_67,plain,
( iext(uri_ex_hasCousin,X1,X2)
| ~ iext(uri_ex_hasUncle,X1,X3)
| ~ iext(uri_ex_hasFather,X2,X3) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,plain,
iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave),
i_0_15 ).
cnf(c_0_69,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_first,esk6_0,X4)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk6_0)
| ~ iext(uri_ex_hasFather,X5,X3)
| ~ iext(X4,X2,X5) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,plain,
iext(uri_rdf_first,esk6_0,uri_ex_hasCousin),
i_0_28 ).
cnf(c_0_71,plain,
( iext(uri_ex_hasCousin,uri_ex_bob,X1)
| ~ iext(uri_ex_hasFather,X1,uri_ex_dave) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,plain,
iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave),
i_0_18 ).
cnf(c_0_73,plain,
( iext(X1,X2,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk6_0)
| ~ iext(uri_ex_hasFather,X4,X3)
| ~ iext(uri_ex_hasCousin,X2,X4) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,esk6_0),
i_0_29 ).
cnf(c_0_75,negated_conjecture,
( ~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)
| ~ iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
i_0_14 ).
cnf(c_0_76,plain,
iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_77,plain,
( iext(uri_ex_hasUncle,X1,X2)
| ~ iext(uri_ex_hasFather,X3,X2)
| ~ iext(uri_ex_hasCousin,X1,X3) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_78,plain,
iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly),
i_0_16 ).
cnf(c_0_79,negated_conjecture,
~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]) ).
cnf(c_0_80,plain,
( iext(uri_ex_hasUncle,X1,uri_ex_charly)
| ~ iext(uri_ex_hasCousin,X1,uri_ex_bob) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,plain,
iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob),
i_0_17 ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWB025+2 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 : Wed Jun 1 08:34:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 7.77/2.32 # ENIGMATIC: Solved by autoschedule:
% 7.77/2.32 # No SInE strategy applied
% 7.77/2.32 # Trying AutoSched0 for 150 seconds
% 7.77/2.32 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S059I
% 7.77/2.32 # and selection function SelectComplexExceptUniqMaxPosHorn.
% 7.77/2.32 #
% 7.77/2.32 # Preprocessing time : 0.012 s
% 7.77/2.32 # Presaturation interreduction done
% 7.77/2.32
% 7.77/2.32 # Proof found!
% 7.77/2.32 # SZS status Theorem
% 7.77/2.32 # SZS output start CNFRefutation
% See solution above
% 7.77/2.32 # Training examples: 0 positive, 0 negative
% 7.77/2.32
% 7.77/2.32 # -------------------------------------------------
% 7.77/2.32 # User time : 0.015 s
% 7.77/2.32 # System time : 0.005 s
% 7.77/2.32 # Total time : 0.020 s
% 7.77/2.32 # Maximum resident set size: 7120 pages
% 7.77/2.32
%------------------------------------------------------------------------------