%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET014-2 : TPTP v8.1.0. Bugfixed v2.1.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 : n017.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 00:56:12 EDT 2022 % Result : Unsatisfiable 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET014-2 : TPTP v8.1.0. Bugfixed v2.1.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.13/0.34 % Computer : n017.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 : Mon Jul 11 09:38:33 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: 24 Number of unprocessed: 24 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 24 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 6 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 18 extension rule candidate clauses % 0.13/0.37 # 6 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_46, hypothesis, (subset(as,cs))). % 0.13/0.37 cnf(i_0_47, hypothesis, (subset(bs,cs))). % 0.13/0.37 cnf(i_0_40, plain, (equal_sets(X1,X1))). % 0.13/0.37 cnf(i_0_43, plain, (equal_elements(X1,X1))). % 0.13/0.37 cnf(i_0_48, negated_conjecture, (~subset(union(as,bs),cs))). % 0.13/0.37 cnf(i_0_25, plain, (~member(X1,empty_set))). % 0.13/0.37 cnf(i_0_38, plain, (subset(X1,X2)|~equal_sets(X2,X1))). % 0.13/0.37 cnf(i_0_30, plain, (~member(X1,complement(X2))|~member(X1,X2))). % 0.13/0.37 cnf(i_0_37, plain, (subset(X1,X2)|~equal_sets(X1,X2))). % 0.13/0.37 cnf(i_0_41, plain, (equal_sets(X1,X2)|~equal_sets(X2,X1))). % 0.13/0.37 cnf(i_0_44, plain, (equal_elements(X1,X2)|~equal_elements(X2,X1))). % 0.13/0.37 cnf(i_0_29, plain, (member(X1,complement(X2))|member(X1,X2))). % 0.13/0.37 cnf(i_0_28, plain, (subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2))). % 0.13/0.37 cnf(i_0_39, plain, (equal_sets(X1,X2)|~subset(X1,X2)|~subset(X2,X1))). % 0.13/0.37 cnf(i_0_36, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 0.13/0.37 cnf(i_0_35, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 0.13/0.37 cnf(i_0_27, plain, (subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1))). % 0.13/0.37 cnf(i_0_32, plain, (member(X1,union(X2,X3))|~member(X1,X3))). % 0.13/0.37 cnf(i_0_26, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 0.13/0.37 cnf(i_0_42, plain, (equal_sets(X1,X2)|~equal_sets(X3,X2)|~equal_sets(X1,X3))). % 0.13/0.37 cnf(i_0_45, plain, (equal_elements(X1,X2)|~equal_elements(X3,X2)|~equal_elements(X1,X3))). % 0.13/0.37 cnf(i_0_31, plain, (member(X1,union(X2,X3))|~member(X1,X2))). % 0.13/0.37 cnf(i_0_33, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))). % 0.13/0.37 cnf(i_0_34, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 4 steps % 0.13/0.37 cnf(i_0_48, negated_conjecture, (~subset(union(as,bs),cs)), inference(start_rule)). % 0.13/0.37 cnf(i_0_49, plain, (~subset(union(as,bs),cs)), inference(extension_rule, [i_0_27])). % 0.13/0.37 cnf(i_0_72, plain, (member(member_of_1_not_of_2(union(as,bs),cs),union(as,bs))), inference(extension_rule, [i_0_30])). % 0.13/0.37 cnf(i_0_94, plain, (~member(member_of_1_not_of_2(union(as,bs),cs),complement(union(as,bs)))), inference(etableau_closure_rule, [i_0_94, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 4 tableaux to operate on % 0.13/0.37 # Found closed tableau during pool population. % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------