%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET902+1 : TPTP v8.1.0. Released v3.2.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 : n006.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 : Tue Jul 19 01:03:42 EDT 2022 % Result : Theorem 0.19s 0.37s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET902+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n006.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jul 10 02:17:21 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 17 Number of unprocessed: 16 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 16 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 4 conjectures. % 0.19/0.37 # There are 4 start rule candidates: % 0.19/0.37 # Found 10 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 4 start rule tableaux created. % 0.19/0.37 # 6 extension rule candidate clauses % 0.19/0.37 # 10 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 4 % 0.19/0.37 # There were 3 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 3 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 3 successful branch saturations after the branch. % 0.19/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_16, negated_conjecture, (set_union2(esk4_0,esk5_0)=singleton(esk3_0))). % 0.19/0.37 cnf(i_0_2, plain, (empty(empty_set))). % 0.19/0.37 cnf(i_0_10, plain, (empty(esk1_0))). % 0.19/0.37 cnf(i_0_12, plain, (subset(X1,X1))). % 0.19/0.37 cnf(i_0_5, plain, (set_union2(X1,X1)=X1)). % 0.19/0.37 cnf(i_0_8, plain, (subset(empty_set,singleton(X1)))). % 0.19/0.37 cnf(i_0_17, plain, (subset(X1,set_union2(X1,X2)))). % 0.19/0.37 cnf(i_0_1, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.19/0.37 cnf(i_0_6, plain, (singleton(X1)!=empty_set)). % 0.19/0.37 cnf(i_0_11, plain, (~empty(esk2_0))). % 0.19/0.37 cnf(i_0_14, negated_conjecture, (singleton(esk3_0)!=esk5_0|esk4_0!=empty_set)). % 0.19/0.37 cnf(i_0_13, negated_conjecture, (singleton(esk3_0)!=esk4_0|esk5_0!=empty_set)). % 0.19/0.37 cnf(i_0_15, negated_conjecture, (singleton(esk3_0)!=esk4_0|singleton(esk3_0)!=esk5_0)). % 0.19/0.37 cnf(i_0_4, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.19/0.37 cnf(i_0_3, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.19/0.37 cnf(i_0_9, plain, (X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2)))). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 6 steps % 0.19/0.37 cnf(i_0_14, negated_conjecture, (singleton(esk3_0)!=esk5_0|esk4_0!=empty_set), inference(start_rule)). % 0.19/0.37 cnf(i_0_25, plain, (esk4_0!=empty_set), inference(extension_rule, [i_0_9])). % 0.19/0.37 cnf(i_0_96, plain, (singleton(esk3_0)=esk4_0), inference(extension_rule, [i_0_15])). % 0.19/0.37 cnf(i_0_24, plain, (singleton(esk3_0)!=esk5_0), inference(etableau_closure_rule, [i_0_24, ...])). % 0.19/0.37 cnf(i_0_98, plain, (~subset(esk4_0,singleton(esk3_0))), inference(etableau_closure_rule, [i_0_98, ...])). % 0.19/0.37 cnf(i_0_126, plain, (singleton(esk3_0)!=esk5_0), inference(etableau_closure_rule, [i_0_126, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 6 tableaux to operate on % 0.19/0.37 # Found closed tableau during pool population. % 0.19/0.37 # Proof search is over... % 0.19/0.37 # Freeing feature tree %------------------------------------------------------------------------------