%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS012-1 : TPTP v8.1.0. Released v2.0.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 : 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 : Sun Jul 17 03:00:20 EDT 2022 % Result : Unsatisfiable 0.15s 0.40s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : KRS012-1 : TPTP v8.1.0. Released v2.0.0. % 0.08/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.36 % Computer : n028.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Tue Jun 7 08:30:59 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.39 # No SInE strategy applied % 0.15/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN % 0.15/0.39 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.15/0.39 # % 0.15/0.39 # Presaturation interreduction done % 0.15/0.39 # Number of axioms: 13 Number of unprocessed: 13 % 0.15/0.39 # Tableaux proof search. % 0.15/0.39 # APR header successfully linked. % 0.15/0.39 # Hello from C++ % 0.15/0.39 # The folding up rule is enabled... % 0.15/0.39 # Local unification is enabled... % 0.15/0.39 # Any saturation attempts will use folding labels... % 0.15/0.39 # 13 beginning clauses after preprocessing and clausification % 0.15/0.39 # Creating start rules for all 2 conjectures. % 0.15/0.39 # There are 2 start rule candidates: % 0.15/0.39 # Found 2 unit axioms. % 0.15/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.15/0.39 # 2 start rule tableaux created. % 0.15/0.39 # 11 extension rule candidate clauses % 0.15/0.39 # 2 unit axiom clauses % 0.15/0.39 % 0.15/0.39 # Requested 8, 32 cores available to the main process. % 0.15/0.39 # There are not enough tableaux to fork, creating more from the initial 2 % 0.15/0.39 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.15/0.39 # We now have 8 tableaux to operate on % 0.15/0.40 # Closed tableau found in foldup close cycle with 1 folds and 1 closures done. % 0.15/0.40 # There were 0 total branch saturation attempts. % 0.15/0.40 # There were 0 of these attempts blocked. % 0.15/0.40 # There were 0 deferred branch saturation attempts. % 0.15/0.40 # There were 0 free duplicated saturations. % 0.15/0.40 # There were 0 total successful branch saturations. % 0.15/0.40 # There were 0 successful branch saturations in interreduction. % 0.15/0.40 # There were 0 successful branch saturations on the branch. % 0.15/0.40 # There were 0 successful branch saturations after the branch. % 0.15/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.15/0.40 # Begin clausification derivation % 0.15/0.40 % 0.15/0.40 # End clausification derivation % 0.15/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.40 cnf(i_0_14, negated_conjecture, (c(exists))). % 0.15/0.40 cnf(i_0_15, negated_conjecture, (~f(exists))). % 0.15/0.40 cnf(i_0_25, plain, (f(X1)|~e(u1r1(X1)))). % 0.15/0.40 cnf(i_0_18, plain, (c(X1)|~d(u0r1(X1))|~e(u0r2(X1)))). % 0.15/0.40 cnf(i_0_17, plain, (d(X1)|~r(X2,X1)|~c(X2))). % 0.15/0.40 cnf(i_0_26, plain, (r(X1,u1r1(X1))|f(X1))). % 0.15/0.40 cnf(i_0_19, plain, (d(u0r2(X1))|c(X1)|~d(u0r1(X1)))). % 0.15/0.40 cnf(i_0_24, plain, (e(X1)|~r(X2,X1)|~f(X2))). % 0.15/0.40 cnf(i_0_16, plain, (e(X1)|~r(X2,X1)|~c(X2))). % 0.15/0.40 cnf(i_0_21, plain, (r(X1,u0r1(X1))|c(X1)|~e(u0r2(X1)))). % 0.15/0.40 cnf(i_0_20, plain, (r(X1,u0r2(X1))|c(X1)|~d(u0r1(X1)))). % 0.15/0.40 cnf(i_0_23, plain, (r(X1,u0r2(X1))|r(X1,u0r1(X1))|c(X1))). % 0.15/0.40 cnf(i_0_22, plain, (d(u0r2(X1))|r(X1,u0r1(X1))|c(X1))). % 0.15/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.40 # Begin printing tableau % 0.15/0.40 # Found 6 steps % 0.15/0.40 cnf(i_0_14, negated_conjecture, (c(exists)), inference(start_rule)). % 0.15/0.40 cnf(i_0_28, plain, (c(exists)), inference(extension_rule, [i_0_16])). % 0.15/0.40 cnf(i_0_76, plain, (e(u1r1(exists))), inference(extension_rule, [i_0_25])). % 0.15/0.40 cnf(i_0_91, plain, (f(exists)), inference(closure_rule, [i_0_15])). % 0.15/0.40 cnf(i_0_77, plain, (~r(exists,u1r1(exists))), inference(extension_rule, [i_0_26])). % 0.15/0.40 cnf(i_0_255, plain, (f(exists)), inference(closure_rule, [i_0_15])). % 0.15/0.40 # End printing tableau % 0.15/0.40 # SZS output end % 0.15/0.40 # Branches closed with saturation will be marked with an "s" % 0.15/0.40 # Child (19530) has found a proof. % 0.15/0.40 % 0.15/0.40 # Proof search is over... % 0.15/0.40 # Freeing feature tree %------------------------------------------------------------------------------