%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET014-4 : TPTP v8.1.0. Bugfixed v1.2.1. % 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 : n027.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:13 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.07/0.12 % Problem : SET014-4 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n027.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sun Jul 10 07:14:17 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 17 Number of unprocessed: 17 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # 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 # 17 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 4 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 13 extension rule candidate clauses % 0.13/0.37 # 4 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/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/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_34, hypothesis, (subset(as,cs))). % 0.13/0.37 cnf(i_0_35, hypothesis, (subset(bs,cs))). % 0.13/0.37 cnf(i_0_36, negated_conjecture, (~subset(complement(intersection(complement(as),complement(bs))),cs))). % 0.13/0.37 cnf(i_0_29, plain, (~member(X1,empty_set))). % 0.13/0.37 cnf(i_0_30, plain, (member(X1,universal_set)|~little_set(X1))). % 0.13/0.37 cnf(i_0_19, plain, (little_set(X1)|~member(X1,X2))). % 0.13/0.37 cnf(i_0_20, plain, (X1=X2|little_set(f1(X1,X2)))). % 0.13/0.37 cnf(i_0_26, plain, (~member(X1,complement(X2))|~member(X1,X2))). % 0.13/0.37 cnf(i_0_24, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 0.13/0.37 cnf(i_0_23, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 0.13/0.37 cnf(i_0_33, plain, (subset(X1,X2)|~member(f17(X1,X2),X2))). % 0.13/0.37 cnf(i_0_32, plain, (subset(X1,X2)|member(f17(X1,X2),X1))). % 0.13/0.37 cnf(i_0_27, plain, (member(X1,complement(X2))|member(X1,X2)|~little_set(X1))). % 0.13/0.37 cnf(i_0_31, plain, (member(X1,X2)|~subset(X3,X2)|~member(X1,X3))). % 0.13/0.37 cnf(i_0_25, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 0.13/0.37 cnf(i_0_22, plain, (X1=X2|~member(f1(X1,X2),X2)|~member(f1(X1,X2),X1))). % 0.13/0.37 cnf(i_0_21, plain, (X1=X2|member(f1(X1,X2),X1)|member(f1(X1,X2),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_36, negated_conjecture, (~subset(complement(intersection(complement(as),complement(bs))),cs)), inference(start_rule)). % 0.13/0.37 cnf(i_0_37, plain, (~subset(complement(intersection(complement(as),complement(bs))),cs)), inference(extension_rule, [i_0_32])). % 0.13/0.37 cnf(i_0_53, plain, (member(f17(complement(intersection(complement(as),complement(bs))),cs),complement(intersection(complement(as),complement(bs))))), inference(extension_rule, [i_0_19])). % 0.13/0.37 cnf(i_0_71, plain, (little_set(f17(complement(intersection(complement(as),complement(bs))),cs))), inference(etableau_closure_rule, [i_0_71, ...])). % 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 2 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 2 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 %------------------------------------------------------------------------------