%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS003-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 : n020.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:18 EDT 2022 % Result : Unsatisfiable 0.17s 0.35s % Output : CNFRefutation 0.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : KRS003-1 : TPTP v8.1.0. Released v2.0.0. % 0.10/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.31 % Computer : n020.cluster.edu % 0.12/0.31 % Model : x86_64 x86_64 % 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.31 % Memory : 8042.1875MB % 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.31 % CPULimit : 300 % 0.12/0.31 % WCLimit : 600 % 0.12/0.31 % DateTime : Tue Jun 7 18:58:51 EDT 2022 % 0.17/0.31 % CPUTime : % 0.17/0.34 # No SInE strategy applied % 0.17/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.17/0.34 # and selection function SelectComplexExceptUniqMaxHorn. % 0.17/0.34 # % 0.17/0.34 # Presaturation interreduction done % 0.17/0.34 # Number of axioms: 16 Number of unprocessed: 16 % 0.17/0.34 # Tableaux proof search. % 0.17/0.34 # APR header successfully linked. % 0.17/0.34 # Hello from C++ % 0.17/0.34 # The folding up rule is enabled... % 0.17/0.34 # Local unification is enabled... % 0.17/0.34 # Any saturation attempts will use folding labels... % 0.17/0.34 # 16 beginning clauses after preprocessing and clausification % 0.17/0.34 # Creating start rules for all 2 conjectures. % 0.17/0.34 # There are 2 start rule candidates: % 0.17/0.34 # Found 2 unit axioms. % 0.17/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.17/0.34 # 2 start rule tableaux created. % 0.17/0.34 # 14 extension rule candidate clauses % 0.17/0.34 # 2 unit axiom clauses % 0.17/0.34 % 0.17/0.34 # Requested 8, 32 cores available to the main process. % 0.17/0.34 # There are not enough tableaux to fork, creating more from the initial 2 % 0.17/0.35 # There were 1 total branch saturation attempts. % 0.17/0.35 # There were 0 of these attempts blocked. % 0.17/0.35 # There were 0 deferred branch saturation attempts. % 0.17/0.35 # There were 0 free duplicated saturations. % 0.17/0.35 # There were 1 total successful branch saturations. % 0.17/0.35 # There were 0 successful branch saturations in interreduction. % 0.17/0.35 # There were 0 successful branch saturations on the branch. % 0.17/0.35 # There were 1 successful branch saturations after the branch. % 0.17/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.35 # Begin clausification derivation % 0.17/0.35 % 0.17/0.35 # End clausification derivation % 0.17/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.17/0.35 cnf(i_0_17, negated_conjecture, (e(exist))). % 0.17/0.35 cnf(i_0_18, negated_conjecture, (f(exist))). % 0.17/0.35 cnf(i_0_31, plain, (c(X1)|~e(X1))). % 0.17/0.35 cnf(i_0_32, plain, (d(X1)|~f(X1))). % 0.17/0.35 cnf(i_0_19, plain, (s2least(X1)|~c(X1))). % 0.17/0.35 cnf(i_0_20, plain, (c(X1)|~s2least(X1))). % 0.17/0.35 cnf(i_0_25, plain, (s1most(X1)|~d(X1))). % 0.17/0.35 cnf(i_0_26, plain, (d(X1)|~s1most(X1))). % 0.17/0.35 cnf(i_0_21, plain, (~equalish(u1r2(X1),u1r1(X1))|~s2least(X1))). % 0.17/0.35 cnf(i_0_28, plain, (s1most(X1)|~equalish(u3r2(X1),u3r1(X1)))). % 0.17/0.35 cnf(i_0_23, plain, (s(X1,u1r2(X1))|~s2least(X1))). % 0.17/0.35 cnf(i_0_30, plain, (s1most(X1)|s(X1,u3r2(X1)))). % 0.17/0.35 cnf(i_0_22, plain, (s(X1,u1r1(X1))|~s2least(X1))). % 0.17/0.35 cnf(i_0_29, plain, (s1most(X1)|s(X1,u3r1(X1)))). % 0.17/0.35 cnf(i_0_27, plain, (equalish(X1,X2)|~s1most(X3)|~s(X3,X2)|~s(X3,X1))). % 0.17/0.35 cnf(i_0_24, plain, (equalish(X1,X2)|s2least(X3)|~s(X3,X2)|~s(X3,X1))). % 0.17/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.17/0.35 # Begin printing tableau % 0.17/0.35 # Found 4 steps % 0.17/0.35 cnf(i_0_17, negated_conjecture, (e(exist)), inference(start_rule)). % 0.17/0.35 cnf(i_0_34, plain, (e(exist)), inference(extension_rule, [i_0_31])). % 0.17/0.35 cnf(i_0_67, plain, (c(exist)), inference(extension_rule, [i_0_19])). % 0.17/0.35 cnf(i_0_103, plain, (s2least(exist)), inference(etableau_closure_rule, [i_0_103, ...])). % 0.17/0.35 # End printing tableau % 0.17/0.35 # SZS output end % 0.17/0.35 # Branches closed with saturation will be marked with an "s" % 0.17/0.35 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.17/0.35 # We now have 2 tableaux to operate on % 0.17/0.35 # Found closed tableau during pool population. % 0.17/0.35 # Proof search is over... % 0.17/0.35 # Freeing feature tree %------------------------------------------------------------------------------