%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS178+1 : TPTP v8.1.0. Bugfixed v5.4.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 : n032.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:46 EDT 2022 % Result : Theorem 0.14s 0.32s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.10 % Problem : KRS178+1 : TPTP v8.1.0. Bugfixed v5.4.0. % 0.03/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.29 % Computer : n032.cluster.edu % 0.11/0.29 % Model : x86_64 x86_64 % 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.29 % Memory : 8042.1875MB % 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.29 % CPULimit : 300 % 0.11/0.29 % WCLimit : 600 % 0.11/0.29 % DateTime : Tue Jun 7 17:06:06 EDT 2022 % 0.11/0.29 % CPUTime : % 0.14/0.32 # No SInE strategy applied % 0.14/0.32 # Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S % 0.14/0.32 # and selection function SelectNewComplexAHPNS. % 0.14/0.32 # % 0.14/0.32 # Presaturation interreduction done % 0.14/0.32 # Number of axioms: 36 Number of unprocessed: 34 % 0.14/0.32 # Tableaux proof search. % 0.14/0.32 # APR header successfully linked. % 0.14/0.32 # Hello from C++ % 0.14/0.32 # The folding up rule is enabled... % 0.14/0.32 # Local unification is enabled... % 0.14/0.32 # Any saturation attempts will use folding labels... % 0.14/0.32 # 34 beginning clauses after preprocessing and clausification % 0.14/0.32 # Creating start rules for all 1 conjectures. % 0.14/0.32 # There are 1 start rule candidates: % 0.14/0.32 # Found 14 unit axioms. % 0.14/0.32 # 1 start rule tableaux created. % 0.14/0.32 # 20 extension rule candidate clauses % 0.14/0.32 # 14 unit axiom clauses % 0.14/0.32 % 0.14/0.32 # Requested 8, 32 cores available to the main process. % 0.14/0.32 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.32 # There were 2 total branch saturation attempts. % 0.14/0.32 # There were 0 of these attempts blocked. % 0.14/0.32 # There were 0 deferred branch saturation attempts. % 0.14/0.32 # There were 1 free duplicated saturations. % 0.14/0.32 # There were 2 total successful branch saturations. % 0.14/0.32 # There were 0 successful branch saturations in interreduction. % 0.14/0.32 # There were 0 successful branch saturations on the branch. % 0.14/0.32 # There were 1 successful branch saturations after the branch. % 0.14/0.32 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.32 # Begin clausification derivation % 0.14/0.32 % 0.14/0.32 # End clausification derivation % 0.14/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.32 cnf(i_0_23, plain, (model(esk13_0,esk12_0))). % 0.14/0.32 cnf(i_0_27, plain, (model(esk18_0,esk16_0))). % 0.14/0.32 cnf(i_0_26, plain, (model(esk18_0,esk17_0))). % 0.14/0.32 cnf(i_0_32, plain, (model(esk22_0,esk20_0))). % 0.14/0.32 cnf(i_0_29, plain, (model(esk23_0,esk21_0))). % 0.14/0.32 cnf(i_0_35, plain, (model(esk25_0,esk26_0))). % 0.14/0.32 cnf(i_0_21, plain, (model(X1,esk11_0))). % 0.14/0.32 cnf(i_0_33, plain, (model(esk28_0,esk27_0))). % 0.14/0.32 cnf(i_0_36, negated_conjecture, (~isa(esk29_0,esk29_0))). % 0.14/0.32 cnf(i_0_24, plain, (~model(X1,esk15_0))). % 0.14/0.32 cnf(i_0_22, plain, (~model(esk14_0,esk12_0))). % 0.14/0.32 cnf(i_0_30, plain, (~model(esk23_0,esk20_0))). % 0.14/0.32 cnf(i_0_28, plain, (~model(esk24_0,esk21_0))). % 0.14/0.32 cnf(i_0_34, plain, (~model(esk25_0,esk27_0))). % 0.14/0.32 cnf(i_0_10, plain, (~nevera(X1,X2)|~status(X3,X4,X2)|~status(X3,X4,X1))). % 0.14/0.32 cnf(i_0_14, plain, (~xora(X1,X2)|~status(X3,X4,X2)|~status(X3,X4,X1))). % 0.14/0.32 cnf(i_0_7, plain, (~nota(X1,X2)|~status(esk5_2(X1,X2),esk6_2(X1,X2),X2))). % 0.14/0.32 cnf(i_0_6, plain, (isa(X1,X2)|status(esk3_2(X1,X2),esk4_2(X1,X2),X1))). % 0.14/0.32 cnf(i_0_5, plain, (isa(X1,X2)|~status(esk3_2(X1,X2),esk4_2(X1,X2),X2))). % 0.14/0.32 cnf(i_0_4, plain, (status(X1,X2,X3)|~isa(X4,X3)|~status(X1,X2,X4))). % 0.14/0.32 cnf(i_0_18, plain, (~model(X1,not(X2))|~model(X1,X2))). % 0.14/0.32 cnf(i_0_13, plain, (status(X1,X2,X3)|status(X1,X2,X4)|~xora(X3,X4))). % 0.14/0.32 cnf(i_0_9, plain, (nota(X1,X2)|status(X3,X4,X2)|~status(X3,X4,X1))). % 0.14/0.32 cnf(i_0_3, plain, (mighta(X1,X2)|~status(X3,X4,X2)|~status(X3,X4,X1))). % 0.14/0.32 cnf(i_0_25, plain, (~model(esk19_0,esk16_0)|~model(esk19_0,esk17_0))). % 0.14/0.32 cnf(i_0_11, plain, (nevera(X1,X2)|status(esk7_2(X1,X2),esk8_2(X1,X2),X2))). % 0.14/0.32 cnf(i_0_12, plain, (nevera(X1,X2)|status(esk7_2(X1,X2),esk8_2(X1,X2),X1))). % 0.14/0.32 cnf(i_0_1, plain, (status(esk1_2(X1,X2),esk2_2(X1,X2),X2)|~mighta(X1,X2))). % 0.14/0.32 cnf(i_0_2, plain, (status(esk1_2(X1,X2),esk2_2(X1,X2),X1)|~mighta(X1,X2))). % 0.14/0.32 cnf(i_0_8, plain, (status(esk5_2(X1,X2),esk6_2(X1,X2),X1)|~nota(X1,X2))). % 0.14/0.32 cnf(i_0_16, plain, (xora(X1,X2)|status(esk9_2(X1,X2),esk10_2(X1,X2),X2)|~status(esk9_2(X1,X2),esk10_2(X1,X2),X1))). % 0.14/0.32 cnf(i_0_15, plain, (xora(X1,X2)|status(esk9_2(X1,X2),esk10_2(X1,X2),X1)|~status(esk9_2(X1,X2),esk10_2(X1,X2),X2))). % 0.14/0.32 cnf(i_0_17, plain, (model(X1,not(X2))|model(X1,X2))). % 0.14/0.32 cnf(i_0_31, plain, (model(X1,esk21_0)|~model(X1,esk20_0))). % 0.14/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.32 # Begin printing tableau % 0.14/0.32 # Found 5 steps % 0.14/0.32 cnf(i_0_36, negated_conjecture, (~isa(esk29_0,esk29_0)), inference(start_rule)). % 0.14/0.32 cnf(i_0_37, plain, (~isa(esk29_0,esk29_0)), inference(extension_rule, [i_0_5])). % 0.14/0.32 cnf(i_0_49, plain, (~status(esk3_2(esk29_0,esk29_0),esk4_2(esk29_0,esk29_0),esk29_0)), inference(extension_rule, [i_0_13])). % 0.14/0.32 cnf(i_0_103, plain, (status(esk3_2(esk29_0,esk29_0),esk4_2(esk29_0,esk29_0),esk29_0)), inference(closure_rule, [i_0_49])). % 0.14/0.32 cnf(i_0_105, plain, (~xora(esk29_0,esk29_0)), inference(etableau_closure_rule, [i_0_105, ...])). % 0.14/0.32 # End printing tableau % 0.14/0.32 # SZS output end % 0.14/0.32 # Branches closed with saturation will be marked with an "s" % 0.14/0.32 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.14/0.32 # We now have 4 tableaux to operate on % 0.14/0.32 # Found closed tableau during pool population. % 0.14/0.32 # Proof search is over... % 0.14/0.32 # Freeing feature tree %------------------------------------------------------------------------------