%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET013-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 : n015.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:10 EDT 2022 % Result : Unsatisfiable 1.40s 1.58s % Output : CNFRefutation 1.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SET013-2 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.04/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.33 % Computer : n015.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jul 10 08:03:38 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.36 # No SInE strategy applied % 0.20/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.36 # % 0.20/0.36 # Presaturation interreduction done % 0.20/0.36 # Number of axioms: 24 Number of unprocessed: 24 % 0.20/0.36 # Tableaux proof search. % 0.20/0.36 # APR header successfully linked. % 0.20/0.36 # Hello from C++ % 0.62/0.77 # The folding up rule is enabled... % 0.62/0.77 # Local unification is enabled... % 0.62/0.77 # Any saturation attempts will use folding labels... % 0.62/0.77 # 24 beginning clauses after preprocessing and clausification % 0.62/0.77 # Creating start rules for all 1 conjectures. % 0.62/0.77 # There are 1 start rule candidates: % 0.62/0.77 # Found 6 unit axioms. % 0.62/0.77 # 1 start rule tableaux created. % 0.62/0.77 # 18 extension rule candidate clauses % 0.62/0.77 # 6 unit axiom clauses % 0.62/0.77 % 0.62/0.77 # Requested 8, 32 cores available to the main process. % 0.62/0.77 # There are not enough tableaux to fork, creating more from the initial 1 % 1.40/1.58 # There were 4 total branch saturation attempts. % 1.40/1.58 # There were 0 of these attempts blocked. % 1.40/1.58 # There were 0 deferred branch saturation attempts. % 1.40/1.58 # There were 1 free duplicated saturations. % 1.40/1.58 # There were 3 total successful branch saturations. % 1.40/1.58 # There were 0 successful branch saturations in interreduction. % 1.40/1.58 # There were 0 successful branch saturations on the branch. % 1.40/1.58 # There were 2 successful branch saturations after the branch. % 1.40/1.58 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.40/1.58 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.40/1.58 # Begin clausification derivation % 1.40/1.58 % 1.40/1.58 # End clausification derivation % 1.40/1.58 # Begin listing active clauses obtained from FOF to CNF conversion % 1.40/1.58 cnf(i_0_40, plain, (equal_sets(X1,X1))). % 1.40/1.58 cnf(i_0_43, plain, (equal_elements(X1,X1))). % 1.40/1.58 cnf(i_0_46, hypothesis, (equal_sets(intersection(as,bs),cs))). % 1.40/1.58 cnf(i_0_47, hypothesis, (equal_sets(intersection(bs,as),ds))). % 1.40/1.58 cnf(i_0_48, negated_conjecture, (~equal_sets(cs,ds))). % 1.40/1.58 cnf(i_0_25, plain, (~member(X1,empty_set))). % 1.40/1.58 cnf(i_0_38, plain, (subset(X1,X2)|~equal_sets(X2,X1))). % 1.40/1.58 cnf(i_0_30, plain, (~member(X1,complement(X2))|~member(X1,X2))). % 1.40/1.58 cnf(i_0_37, plain, (subset(X1,X2)|~equal_sets(X1,X2))). % 1.40/1.58 cnf(i_0_41, plain, (equal_sets(X1,X2)|~equal_sets(X2,X1))). % 1.40/1.58 cnf(i_0_44, plain, (equal_elements(X1,X2)|~equal_elements(X2,X1))). % 1.40/1.58 cnf(i_0_29, plain, (member(X1,complement(X2))|member(X1,X2))). % 1.40/1.58 cnf(i_0_42, plain, (equal_sets(X1,X2)|~equal_sets(X3,X2)|~equal_sets(X1,X3))). % 1.40/1.58 cnf(i_0_36, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 1.40/1.58 cnf(i_0_35, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 1.40/1.58 cnf(i_0_28, plain, (subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2))). % 1.40/1.58 cnf(i_0_27, plain, (subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1))). % 1.40/1.58 cnf(i_0_32, plain, (member(X1,union(X2,X3))|~member(X1,X3))). % 1.40/1.58 cnf(i_0_39, plain, (equal_sets(X1,X2)|~subset(X1,X2)|~subset(X2,X1))). % 1.40/1.58 cnf(i_0_26, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 1.40/1.58 cnf(i_0_45, plain, (equal_elements(X1,X2)|~equal_elements(X3,X2)|~equal_elements(X1,X3))). % 1.40/1.58 cnf(i_0_31, plain, (member(X1,union(X2,X3))|~member(X1,X2))). % 1.40/1.58 cnf(i_0_34, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 1.40/1.58 cnf(i_0_33, plain, (member(X1,X2)|member(X1,X3)|~member(X1,union(X2,X3)))). % 1.40/1.58 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.40/1.58 # Begin printing tableau % 1.40/1.58 # Found 5 steps % 1.40/1.58 cnf(i_0_48, negated_conjecture, (~equal_sets(cs,ds)), inference(start_rule)). % 1.40/1.58 cnf(i_0_49, plain, (~equal_sets(cs,ds)), inference(extension_rule, [i_0_39])). % 1.40/1.58 cnf(i_0_76, plain, (~subset(cs,ds)), inference(extension_rule, [i_0_28])). % 1.40/1.58 cnf(i_0_77, plain, (~subset(ds,cs)), inference(etableau_closure_rule, [i_0_77, ...])). % 1.40/1.58 cnf(i_0_125197, plain, (~member(member_of_1_not_of_2(cs,ds),ds)), inference(etableau_closure_rule, [i_0_125197, ...])). % 1.40/1.58 # End printing tableau % 1.40/1.58 # SZS output end % 1.40/1.58 # Branches closed with saturation will be marked with an "s" % 1.40/1.58 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 1.40/1.58 # We now have 4 tableaux to operate on % 1.40/1.58 # Found closed tableau during pool population. % 1.40/1.58 # Proof search is over... % 1.40/1.58 # Freeing feature tree %------------------------------------------------------------------------------