%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET175+3 : TPTP v8.1.0. Released v2.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 : n021.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:58:36 EDT 2022 % Result : Theorem 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SET175+3 : TPTP v8.1.0. Released v2.2.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.13/0.34 % Computer : n021.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 10:55:07 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y % 0.13/0.37 # and selection function SelectMaxLComplexAPPNTNp. % 0.13/0.37 # % 0.13/0.37 # Number of axioms: 18 Number of unprocessed: 18 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 18 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 1 conjectures. % 0.20/0.38 # There are 1 start rule candidates: % 0.20/0.38 # Found 4 unit axioms. % 0.20/0.38 # 1 start rule tableaux created. % 0.20/0.38 # 14 extension rule candidate clauses % 0.20/0.38 # 4 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.39 # There were 3 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 1 free duplicated saturations. % 0.20/0.39 # There were 3 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 2 successful branch saturations after the branch. % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_15, plain, (subset(X1,X1))). % 0.20/0.39 cnf(i_0_8, plain, (subset(X1,X2)|X1!=X2)). % 0.20/0.39 cnf(i_0_9, plain, (subset(X1,X2)|X1!=X2)). % 0.20/0.39 cnf(i_0_10, plain, (union(X1,X2)=union(X2,X1))). % 0.20/0.39 cnf(i_0_11, plain, (intersection(X1,X2)=intersection(X2,X1))). % 0.20/0.39 cnf(i_0_7, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.20/0.39 cnf(i_0_20, negated_conjecture, (union(esk3_0,intersection(esk3_0,esk4_0))!=esk3_0)). % 0.20/0.39 cnf(i_0_13, plain, (subset(X1,X2)|member(esk1_2(X1,X2),X1))). % 0.20/0.39 cnf(i_0_14, plain, (member(X3,X2)|~member(X3,X1)|~subset(X1,X2))). % 0.20/0.39 cnf(i_0_1, plain, (member(X1,union(X3,X2))|~member(X1,X2))). % 0.20/0.39 cnf(i_0_2, plain, (member(X1,union(X2,X3))|~member(X1,X2))). % 0.20/0.39 cnf(i_0_5, plain, (member(X1,X2)|~member(X1,intersection(X3,X2)))). % 0.20/0.39 cnf(i_0_6, plain, (member(X1,X2)|~member(X1,intersection(X2,X3)))). % 0.20/0.39 cnf(i_0_12, plain, (subset(X1,X2)|~member(esk1_2(X1,X2),X2))). % 0.20/0.39 cnf(i_0_16, plain, (X1=X2|member(esk2_2(X1,X2),X2)|member(esk2_2(X1,X2),X1))). % 0.20/0.39 cnf(i_0_4, plain, (member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2))). % 0.20/0.39 cnf(i_0_3, plain, (member(X1,X3)|member(X1,X2)|~member(X1,union(X2,X3)))). % 0.20/0.39 cnf(i_0_17, plain, (X1=X2|~member(esk2_2(X1,X2),X2)|~member(esk2_2(X1,X2),X1))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 5 steps % 0.20/0.39 cnf(i_0_20, negated_conjecture, (union(esk3_0,intersection(esk3_0,esk4_0))!=esk3_0), inference(start_rule)). % 0.20/0.39 cnf(i_0_21, plain, (union(esk3_0,intersection(esk3_0,esk4_0))!=esk3_0), inference(extension_rule, [i_0_17])). % 0.20/0.39 cnf(i_0_54, plain, (~member(esk2_2(union(esk3_0,intersection(esk3_0,esk4_0)),esk3_0),esk3_0)), inference(extension_rule, [i_0_5])). % 0.20/0.39 cnf(i_0_55, plain, (~member(esk2_2(union(esk3_0,intersection(esk3_0,esk4_0)),esk3_0),union(esk3_0,intersection(esk3_0,esk4_0)))), inference(etableau_closure_rule, [i_0_55, ...])). % 0.20/0.39 cnf(i_0_599, plain, (~member(esk2_2(union(esk3_0,intersection(esk3_0,esk4_0)),esk3_0),intersection(X6,esk3_0))), inference(etableau_closure_rule, [i_0_599, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.20/0.39 # We now have 4 tableaux to operate on % 0.20/0.39 # Found closed tableau during pool population. % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------