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