%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : TOP001-2 : TPTP v8.1.0. Released v1.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 : Thu Jul 21 21:25:35 EDT 2022 % Result : Unsatisfiable 0.12s 0.36s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : TOP001-2 : TPTP v8.1.0. Released v1.0.0. % 0.06/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.32 % Computer : n028.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 600 % 0.12/0.32 % DateTime : Sun May 29 14:17:33 EDT 2022 % 0.12/0.32 % CPUTime : % 0.12/0.35 # No SInE strategy applied % 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.35 # % 0.12/0.35 # Presaturation interreduction done % 0.12/0.35 # Number of axioms: 13 Number of unprocessed: 13 % 0.12/0.35 # Tableaux proof search. % 0.12/0.35 # APR header successfully linked. % 0.12/0.35 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 13 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 2 conjectures. % 0.12/0.36 # There are 2 start rule candidates: % 0.12/0.36 # Found 3 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 2 start rule tableaux created. % 0.12/0.36 # 10 extension rule candidate clauses % 0.12/0.36 # 3 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.36 # There were 1 total branch saturation attempts. % 0.12/0.36 # There were 0 of these attempts blocked. % 0.12/0.36 # There were 0 deferred branch saturation attempts. % 0.12/0.36 # There were 0 free duplicated saturations. % 0.12/0.36 # There were 1 total successful branch saturations. % 0.12/0.36 # There were 0 successful branch saturations in interreduction. % 0.12/0.36 # There were 0 successful branch saturations on the branch. % 0.12/0.36 # There were 1 successful branch saturations after the branch. % 0.12/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.36 # Begin clausification derivation % 0.12/0.36 % 0.12/0.36 # End clausification derivation % 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.36 cnf(i_0_25, negated_conjecture, (basis(cx,f))). % 0.12/0.36 cnf(i_0_20, plain, (subset_sets(X1,X1))). % 0.12/0.36 cnf(i_0_26, negated_conjecture, (~subset_sets(union_of_members(top_of_basis(f)),cx))). % 0.12/0.36 cnf(i_0_22, plain, (subset_sets(X1,X2)|~equal_sets(X1,X2))). % 0.12/0.36 cnf(i_0_17, plain, (equal_sets(union_of_members(X1),X2)|~basis(X2,X1))). % 0.12/0.36 cnf(i_0_23, plain, (subset_sets(X1,X2)|element_of_set(in_1st_set(X1,X2),X1))). % 0.12/0.36 cnf(i_0_24, plain, (subset_sets(X1,X2)|~element_of_set(in_1st_set(X1,X2),X2))). % 0.12/0.36 cnf(i_0_21, plain, (element_of_set(X1,X2)|~subset_sets(X3,X2)|~element_of_set(X1,X3))). % 0.12/0.36 cnf(i_0_14, plain, (element_of_set(X1,f1(X2,X1))|~element_of_set(X1,union_of_members(X2)))). % 0.12/0.36 cnf(i_0_15, plain, (element_of_collection(f1(X1,X2),X1)|~element_of_set(X2,union_of_members(X1)))). % 0.12/0.36 cnf(i_0_16, plain, (element_of_set(X1,union_of_members(X2))|~element_of_collection(X3,X2)|~element_of_set(X1,X3))). % 0.12/0.36 cnf(i_0_18, plain, (element_of_set(X1,f10(X2,X3,X1))|~element_of_collection(X3,top_of_basis(X2))|~element_of_set(X1,X3))). % 0.12/0.36 cnf(i_0_19, plain, (element_of_collection(f10(X1,X2,X3),X1)|~element_of_collection(X2,top_of_basis(X1))|~element_of_set(X3,X2))). % 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.36 # Begin printing tableau % 0.12/0.36 # Found 4 steps % 0.12/0.36 cnf(i_0_25, negated_conjecture, (basis(cx,f)), inference(start_rule)). % 0.12/0.36 cnf(i_0_28, plain, (basis(cx,f)), inference(extension_rule, [i_0_17])). % 0.12/0.36 cnf(i_0_55, plain, (equal_sets(union_of_members(f),cx)), inference(extension_rule, [i_0_22])). % 0.12/0.36 cnf(i_0_77, plain, (subset_sets(union_of_members(f),cx)), inference(etableau_closure_rule, [i_0_77, ...])). % 0.12/0.36 # End printing tableau % 0.12/0.36 # SZS output end % 0.12/0.36 # Branches closed with saturation will be marked with an "s" % 0.12/0.36 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 4 tableaux to operate on % 0.12/0.36 # Found closed tableau during pool population. % 0.12/0.36 # Proof search is over... % 0.12/0.36 # Freeing feature tree %------------------------------------------------------------------------------