%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS129+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n021.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 : Sun Jul 17 03:00:37 EDT 2022 % Result : Theorem 0.11s 0.37s % Output : CNFRefutation 0.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : KRS129+1 : TPTP v8.1.0. Released v3.1.0. % 0.10/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.32 % Computer : n021.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 600 % 0.11/0.32 % DateTime : Tue Jun 7 15:37:21 EDT 2022 % 0.11/0.32 % CPUTime : % 0.11/0.35 # No SInE strategy applied % 0.11/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.11/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.11/0.35 # % 0.11/0.35 # Presaturation interreduction done % 0.11/0.35 # Number of axioms: 25 Number of unprocessed: 25 % 0.11/0.35 # Tableaux proof search. % 0.11/0.35 # APR header successfully linked. % 0.11/0.35 # Hello from C++ % 0.11/0.35 # The folding up rule is enabled... % 0.11/0.35 # Local unification is enabled... % 0.11/0.35 # Any saturation attempts will use folding labels... % 0.11/0.35 # 25 beginning clauses after preprocessing and clausification % 0.11/0.35 # Creating start rules for all 2 conjectures. % 0.11/0.35 # There are 2 start rule candidates: % 0.11/0.35 # Found 15 unit axioms. % 0.11/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.11/0.35 # 2 start rule tableaux created. % 0.11/0.35 # 10 extension rule candidate clauses % 0.11/0.35 # 15 unit axiom clauses % 0.11/0.35 % 0.11/0.35 # Requested 8, 32 cores available to the main process. % 0.11/0.35 # There are not enough tableaux to fork, creating more from the initial 2 % 0.11/0.35 # Creating equality axioms % 0.11/0.35 # Ran out of tableaux, making start rules for all clauses % 0.11/0.35 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux. % 0.11/0.35 # We now have 26 tableaux to operate on % 0.11/0.37 # There were 9 total branch saturation attempts. % 0.11/0.37 # There were 0 of these attempts blocked. % 0.11/0.37 # There were 0 deferred branch saturation attempts. % 0.11/0.37 # There were 0 free duplicated saturations. % 0.11/0.37 # There were 9 total successful branch saturations. % 0.11/0.37 # There were 0 successful branch saturations in interreduction. % 0.11/0.37 # There were 0 successful branch saturations on the branch. % 0.11/0.37 # There were 9 successful branch saturations after the branch. % 0.11/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.37 # Begin clausification derivation % 0.11/0.37 % 0.11/0.37 # End clausification derivation % 0.11/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.37 cnf(i_0_33, plain, (cPerson(iKinnock))). % 0.11/0.37 cnf(i_0_30, plain, (cEuropeanCountry(iBE))). % 0.11/0.37 cnf(i_0_32, plain, (cEuropeanCountry(iFR))). % 0.11/0.37 cnf(i_0_31, plain, (cEuropeanCountry(iES))). % 0.11/0.37 cnf(i_0_36, plain, (cEuropeanCountry(iUK))). % 0.11/0.37 cnf(i_0_34, plain, (cEuropeanCountry(iNL))). % 0.11/0.37 cnf(i_0_35, plain, (cEuropeanCountry(iPT))). % 0.11/0.37 cnf(i_0_37, plain, (rhasEuroMP(iUK,iKinnock))). % 0.11/0.37 cnf(i_0_22, plain, (cEUCountry(iBE))). % 0.11/0.37 cnf(i_0_21, plain, (cEUCountry(iFR))). % 0.11/0.37 cnf(i_0_20, plain, (cEUCountry(iES))). % 0.11/0.37 cnf(i_0_19, plain, (cEUCountry(iUK))). % 0.11/0.37 cnf(i_0_18, plain, (cEUCountry(iNL))). % 0.11/0.37 cnf(i_0_17, plain, (cEUCountry(iPT))). % 0.11/0.37 cnf(i_0_13, plain, (~cowlNothing(X1))). % 0.11/0.37 cnf(i_0_39, negated_conjecture, (xsd_integer(esk3_0)|cowlNothing(esk2_0)|~xsd_string(esk3_0)|~cEuroMP(iKinnock))). % 0.11/0.37 cnf(i_0_38, negated_conjecture, (xsd_string(esk3_0)|cowlNothing(esk2_0)|~xsd_integer(esk3_0)|~cEuroMP(iKinnock))). % 0.11/0.37 cnf(i_0_16, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.11/0.37 cnf(i_0_15, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.11/0.37 cnf(i_0_24, plain, (cEuroMP(X1)|~risEuroMPFrom(X1,X2))). % 0.11/0.37 cnf(i_0_27, plain, (cEUCountry(X1)|~rhasEuroMP(X1,X2))). % 0.11/0.37 cnf(i_0_23, plain, (X1=iPT|X1=iNL|X1=iUK|X1=iES|X1=iFR|X1=iBE|~cEUCountry(X1))). % 0.11/0.37 cnf(i_0_26, plain, (risEuroMPFrom(X1,esk1_1(X1))|~cEuroMP(X1))). % 0.11/0.37 cnf(i_0_29, plain, (rhasEuroMP(X1,X2)|~risEuroMPFrom(X2,X1))). % 0.11/0.37 cnf(i_0_28, plain, (risEuroMPFrom(X1,X2)|~rhasEuroMP(X2,X1))). % 0.11/0.37 cnf(i_0_286, plain, (X47=X47)). % 0.11/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.37 # Begin printing tableau % 0.11/0.37 # Found 14 steps % 0.11/0.37 cnf(i_0_13, plain, (~cowlNothing(esk2_0)), inference(start_rule)). % 0.11/0.37 cnf(i_0_313, plain, (~cowlNothing(esk2_0)), inference(extension_rule, [i_0_38])). % 0.11/0.37 cnf(i_0_605, plain, (xsd_string(esk3_0)), inference(extension_rule, [i_0_298])). % 0.11/0.37 cnf(i_0_607, plain, (~xsd_integer(esk3_0)), inference(etableau_closure_rule, [i_0_607, ...])). % 0.11/0.37 cnf(i_0_608, plain, (~cEuroMP(iKinnock)), inference(etableau_closure_rule, [i_0_608, ...])). % 0.11/0.37 cnf(i_0_664, plain, (xsd_string(iPT)), inference(extension_rule, [i_0_16])). % 0.11/0.37 cnf(i_0_665, plain, (esk3_0!=iPT), inference(extension_rule, [i_0_23])). % 0.11/0.37 cnf(i_0_681, plain, (~xsd_integer(iPT)), inference(etableau_closure_rule, [i_0_681, ...])). % 0.11/0.37 cnf(i_0_689, plain, (esk3_0=iNL), inference(etableau_closure_rule, [i_0_689, ...])). % 0.11/0.37 cnf(i_0_690, plain, (esk3_0=iUK), inference(etableau_closure_rule, [i_0_690, ...])). % 0.11/0.37 cnf(i_0_691, plain, (esk3_0=iES), inference(etableau_closure_rule, [i_0_691, ...])). % 0.11/0.37 cnf(i_0_692, plain, (esk3_0=iFR), inference(etableau_closure_rule, [i_0_692, ...])). % 0.11/0.37 cnf(i_0_693, plain, (esk3_0=iBE), inference(etableau_closure_rule, [i_0_693, ...])). % 0.11/0.37 cnf(i_0_694, plain, (~cEUCountry(esk3_0)), inference(etableau_closure_rule, [i_0_694, ...])). % 0.11/0.37 # End printing tableau % 0.11/0.37 # SZS output end % 0.11/0.37 # Branches closed with saturation will be marked with an "s" % 0.11/0.37 # Child (19205) has found a proof. % 0.11/0.37 % 0.11/0.37 # Proof search is over... % 0.11/0.37 # Freeing feature tree %------------------------------------------------------------------------------