%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET010-1 : 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 : n004.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:06 EDT 2022 % Result : Unsatisfiable 0.12s 0.39s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET010-1 : TPTP v8.1.0. Released v1.0.0. % 0.11/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.33 % Computer : n004.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 14:58:07 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___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.12/0.36 # and selection function SelectNewComplexAHP. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 29 Number of unprocessed: 29 % 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 # 29 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 5 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 24 extension rule candidate clauses % 0.12/0.37 # 5 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 1 % 0.12/0.39 # There were 6 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 2 free duplicated saturations. % 0.12/0.39 # There were 6 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 4 successful branch saturations after the branch. % 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_55, hypothesis, (difference(c,a,cDa))). % 0.12/0.39 cnf(i_0_56, hypothesis, (difference(c,b,cDb))). % 0.12/0.39 cnf(i_0_57, hypothesis, (difference(c,aIb,cD_aIb))). % 0.12/0.39 cnf(i_0_54, hypothesis, (intersection(a,b,aIb))). % 0.12/0.39 cnf(i_0_58, negated_conjecture, (~union(cDa,cDb,cD_aIb))). % 0.12/0.39 cnf(i_0_34, plain, (subset(X1,X2)|~equal_sets(X2,X1))). % 0.12/0.39 cnf(i_0_33, plain, (subset(X1,X2)|~equal_sets(X1,X2))). % 0.12/0.39 cnf(i_0_49, plain, (~difference(X1,X2,X3)|~member(X4,X3)|~member(X4,X2))). % 0.12/0.39 cnf(i_0_30, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 0.12/0.39 cnf(i_0_32, plain, (subset(X1,X2)|~member(member_of_1_not_of_2(X1,X2),X2))). % 0.12/0.39 cnf(i_0_35, plain, (equal_sets(X1,X2)|~subset(X1,X2)|~subset(X2,X1))). % 0.12/0.39 cnf(i_0_31, plain, (subset(X1,X2)|member(member_of_1_not_of_2(X1,X2),X1))). % 0.12/0.39 cnf(i_0_38, plain, (member(X1,X2)|~union(X3,X4,X2)|~member(X1,X4))). % 0.12/0.39 cnf(i_0_37, plain, (member(X1,X2)|~union(X3,X4,X2)|~member(X1,X3))). % 0.12/0.39 cnf(i_0_43, plain, (member(X1,X2)|~intersection(X3,X2,X4)|~member(X1,X4))). % 0.12/0.39 cnf(i_0_42, plain, (member(X1,X2)|~intersection(X2,X3,X4)|~member(X1,X4))). % 0.12/0.39 cnf(i_0_48, plain, (member(X1,X2)|~difference(X2,X3,X4)|~member(X1,X4))). % 0.12/0.39 cnf(i_0_36, plain, (member(X1,X2)|member(X1,X3)|~union(X2,X3,X4)|~member(X1,X4))). % 0.12/0.39 cnf(i_0_44, plain, (member(X1,X2)|~intersection(X3,X4,X2)|~member(X1,X4)|~member(X1,X3))). % 0.12/0.39 cnf(i_0_50, plain, (member(X1,X2)|member(X1,X3)|~difference(X4,X2,X3)|~member(X1,X4))). % 0.12/0.39 cnf(i_0_41, plain, (union(X1,X2,X3)|~member(g(X1,X2,X3),X3)|~member(g(X1,X2,X3),X2))). % 0.12/0.39 cnf(i_0_40, plain, (union(X1,X2,X3)|~member(g(X1,X2,X3),X3)|~member(g(X1,X2,X3),X1))). % 0.12/0.39 cnf(i_0_46, plain, (intersection(X1,X2,X3)|member(h(X1,X2,X3),X2)|member(h(X1,X2,X3),X3))). % 0.12/0.39 cnf(i_0_52, plain, (difference(X1,X2,X3)|member(k(X1,X2,X3),X3)|~member(k(X1,X2,X3),X2))). % 0.12/0.39 cnf(i_0_45, plain, (intersection(X1,X2,X3)|member(h(X1,X2,X3),X1)|member(h(X1,X2,X3),X3))). % 0.12/0.39 cnf(i_0_51, plain, (difference(X1,X2,X3)|member(k(X1,X2,X3),X1)|member(k(X1,X2,X3),X3))). % 0.12/0.39 cnf(i_0_47, plain, (intersection(X1,X2,X3)|~member(h(X1,X2,X3),X3)|~member(h(X1,X2,X3),X2)|~member(h(X1,X2,X3),X1))). % 0.12/0.39 cnf(i_0_39, plain, (union(X1,X2,X3)|member(g(X1,X2,X3),X1)|member(g(X1,X2,X3),X2)|member(g(X1,X2,X3),X3))). % 0.12/0.39 cnf(i_0_53, plain, (difference(X1,X2,X3)|member(k(X1,X2,X3),X2)|~member(k(X1,X2,X3),X3)|~member(k(X1,X2,X3),X1))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 7 steps % 0.12/0.39 cnf(i_0_58, negated_conjecture, (~union(cDa,cDb,cD_aIb)), inference(start_rule)). % 0.12/0.39 cnf(i_0_59, plain, (~union(cDa,cDb,cD_aIb)), inference(extension_rule, [i_0_39])). % 0.12/0.39 cnf(i_0_127, plain, (member(g(cDa,cDb,cD_aIb),cDa)), inference(extension_rule, [i_0_49])). % 0.12/0.39 cnf(i_0_139, plain, (~member(g(cDa,cDb,cD_aIb),cDa)), inference(closure_rule, [i_0_127])). % 0.12/0.39 cnf(i_0_128, plain, (member(g(cDa,cDb,cD_aIb),cDb)), inference(etableau_closure_rule, [i_0_128, ...])). % 0.12/0.39 cnf(i_0_129, plain, (member(g(cDa,cDb,cD_aIb),cD_aIb)), inference(etableau_closure_rule, [i_0_129, ...])). % 0.12/0.39 cnf(i_0_138, plain, (~difference(X6,cDa,cDa)), inference(etableau_closure_rule, [i_0_138, ...])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.12/0.39 # We now have 4 tableaux to operate on % 0.12/0.39 # Found closed tableau during pool population. % 0.12/0.39 # Proof search is over... % 0.12/0.39 # Freeing feature tree %------------------------------------------------------------------------------