%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LAT182-1 : TPTP v8.1.0. Released v3.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 : 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 : Sun Jul 17 04:49:19 EDT 2022 % Result : Unsatisfiable 19.39s 2.83s % Output : CNFRefutation 19.39s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : LAT182-1 : TPTP v8.1.0. Released v3.1.0. % 0.11/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.34 % Computer : n004.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jun 30 11:23:53 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S % 0.12/0.37 # and selection function SelectNewComplexAHP. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 13 Number of unprocessed: 13 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # 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 # 13 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 12 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 1 extension rule candidate clauses % 0.12/0.37 # 12 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.37 # Creating equality axioms % 0.12/0.37 # Ran out of tableaux, making start rules for all clauses % 0.12/0.37 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 19 tableaux to operate on % 19.39/2.83 # There were 2 total branch saturation attempts. % 19.39/2.83 # There were 0 of these attempts blocked. % 19.39/2.83 # There were 0 deferred branch saturation attempts. % 19.39/2.83 # There were 0 free duplicated saturations. % 19.39/2.83 # There were 2 total successful branch saturations. % 19.39/2.83 # There were 0 successful branch saturations in interreduction. % 19.39/2.83 # There were 0 successful branch saturations on the branch. % 19.39/2.83 # There were 2 successful branch saturations after the branch. % 19.39/2.83 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 19.39/2.83 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 19.39/2.83 # Begin clausification derivation % 19.39/2.83 % 19.39/2.83 # End clausification derivation % 19.39/2.83 # Begin listing active clauses obtained from FOF to CNF conversion % 19.39/2.83 cnf(i_0_23, plain, (meet(X1,complement(X1))=zero)). % 19.39/2.83 cnf(i_0_22, plain, (join(X1,complement(X1))=one)). % 19.39/2.83 cnf(i_0_14, plain, (meet(X1,X1)=X1)). % 19.39/2.83 cnf(i_0_15, plain, (join(X1,X1)=X1)). % 19.39/2.83 cnf(i_0_16, plain, (meet(X1,join(X1,X2))=X1)). % 19.39/2.83 cnf(i_0_17, plain, (join(X1,meet(X1,X2))=X1)). % 19.39/2.83 cnf(i_0_20, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))). % 19.39/2.83 cnf(i_0_21, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))). % 19.39/2.83 cnf(i_0_25, plain, (meet(X1,join(meet(X2,join(X1,X3)),meet(X1,join(X3,meet(X1,X2)))))=meet(X1,join(X3,meet(X1,X2))))). % 19.39/2.83 cnf(i_0_18, plain, (meet(X1,X2)=meet(X2,X1))). % 19.39/2.83 cnf(i_0_19, plain, (join(X1,X2)=join(X2,X1))). % 19.39/2.83 cnf(i_0_26, negated_conjecture, (join(meet(a,b),meet(a,c))!=meet(a,join(b,c)))). % 19.39/2.83 cnf(i_0_24, plain, (complement(X1)=X2|meet(X1,X2)!=zero|join(X1,X2)!=one)). % 19.39/2.83 cnf(i_0_31, plain, (X4=X4)). % 19.39/2.83 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 19.39/2.83 # Begin printing tableau % 19.39/2.83 # Found 6 steps % 19.39/2.83 cnf(i_0_14, plain, (meet(zero,zero)=zero), inference(start_rule)). % 19.39/2.83 cnf(i_0_40, plain, (meet(zero,zero)=zero), inference(extension_rule, [i_0_24])). % 19.39/2.83 cnf(i_0_72, plain, (complement(zero)=zero), inference(extension_rule, [i_0_35])). % 19.39/2.83 cnf(i_0_84, plain, (meet(X1,complement(X1))!=zero), inference(closure_rule, [i_0_23])). % 19.39/2.83 cnf(i_0_74, plain, (join(zero,zero)!=one), inference(etableau_closure_rule, [i_0_74, ...])). % 19.39/2.83 cnf(i_0_82, plain, (meet(complement(zero),meet(X1,complement(X1)))=meet(zero,zero)), inference(etableau_closure_rule, [i_0_82, ...])). % 19.39/2.83 # End printing tableau % 19.39/2.83 # SZS output end % 19.39/2.83 # Branches closed with saturation will be marked with an "s" % 19.39/2.84 # Child (28081) has found a proof. % 19.39/2.84 % 19.39/2.84 # Proof search is over... % 19.39/2.84 # Freeing feature tree %------------------------------------------------------------------------------