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